Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Title
Now showing items 672-691 of 1710
-
Geometric and Topological Methods for Biomolecular Visualization
Biomolecules like proteins are the basic building blocks of living systems. It has been observed that the structure of a biomolecule plays an important role in defining its function. In this thesis, we describe novel ... -
Geometric Calibration and Shape Refinement for 3D Reconstruction
This thesis is a contribution towards the methods of 3D reconstruction in computer vision. Most of the 3D reconstruction methods are based on either the principle of triangulation or the principle of photometry. In this ... -
Global Methods for Camera Motion Estimation
This thesis is a contribution towards the problem of Structure-from-Motion (SfM), which has been of interest to the 3D computer vision community for many decades. Structure-from-Motion falls under the class of 3D reconstruction ... -
Going Beyond Pairwise Relationships: Representation Learning on Simplicial Complexes
Relational data appear naturally in many real-world applications and can be modeled using mathematical structures known as graphs. Graphs model entities as nodes and their pairwise relations or interactions as edges. For ... -
A GPU Accelerated Tensor Spectral Method for Subspace Clustering
(2017-11-30)In this thesis we consider the problem of clustering the data lying in a union of subspaces using spectral methods. Though the data generated may have high dimensionality, in many of the applications, such as motion ... -
GPU-Accelerated Quantum Transport Solver to Explore 2D Material Space for Transistor Operation
For decades, silicon has been the mainstay of the semiconductor industry. However, to preserve the electrostatic integrity of MOSFETs (metal oxide semiconductor field effect transistors), technology downscaling necessitates ... -
Graph Clustering Approaches for Speaker Diarization of Conversational Speech
In this era of advanced machine intelligence, real-world speech applications need to be equipped to deal with conversations involving multiple speakers. An essential first step in speech information extraction from ... -
Graph Models For Query Focused Text Summarization And Assessment Of Machine Translation Using Stopwords
(2014-04-09)Text summarization is the task of generating a shortened version of the original text where core ideas of the original text are retained. In this work, we focus on query focused summarization. The task is to generate the ... -
Graph Neural Networks with Parallel Local Neighborhood Aggregations
Graph neural networks (GNNs) have become very popular for processing and analyzing graph-structured data in the last few years. Using message passing as their basic building blocks that aggregate information from neighborhoods, ... -
Grassmannian Fusion Frames for Block Sparse Recovery and Its Application to Burst Error Correction
(2018-05-01)Fusion frames and block sparse recovery are of interest in signal processing and communication applications. In these applications it is required that the fusion frame have some desirable properties. One such requirement ... -
Grid Interactive Quality AC Power Supply With Switching Arm Based Integrated Magnetics For Dynamically Controlled Interconnection Among Multiple Sources And Loads
(2013-09-17)The extensive use of nonlinear loads in today’s world has inspired considerable research interest in the area of power quality improvement. This thesis proposes an integrated magnetics based compact solution which provides ... -
Grobuer Basis Algorithms for Polynomial Ideal Theory over Noetherian Commutative Rings
(2018-05-14)One of the fundamental problems in commutative algebra and algebraic geometry is to understand the nature of the solution space of a system of multivariate polynomial equations over a field k, such as real or complex ... -
Group Testing: A Probably Approximately Correct Analysis and Recovery Algorithms for pooled RT-qPCR
The goal of group testing, also called pool testing, is to successfully identify a set of k defectives from a population of n items using only m (< n) group tests. In each group test, a subset of the n items is tested ... -
Guarding Terrain using k-Watchtowers
The discrete k-watchtower problem for a polyhedral terrain T in R3 with n vertices is to nd k vertical segments, called watchtowers, of smallest height, whose bottom end-points (bases) lie on some vertices of T, and ... -
Guessing And Compression : A Large Deviations Approach
(2011-04-01)The problem of guessing a random string is studied. It arises in the analysis of the strength of secret-key cryptosystems against guessing attacks. Expected number of guesses, or more generally moments of the number of ... -
Hadwiger number and the cartesian product operation on graphs
Abstract page scanned and attached as separate attachment -
Hadwiger's Conjecture On Circular Arc Graphs
(2009-04-30)Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph theory. Hadwiger’s conjecture states that if the chromatic number of a graph G is k, then G has a clique minor of size at ... -
Hall-Effect Current Sensors for Power Electronic Applications : Design and Performance Validation
(2018-03-09)Closed loop Hall-effect current sensors used in power electronic applications require high bandwidth and small transient errors. For this, the behaviour of a closed loop Hall-e ect current sensor is modeled. Analytical ... -
Handling Overloads with Social Consistency
Cloud computing applications have dynamic workloads, and they often observe spikes in the incoming traffic which might result in system overloads. System overloads are generally handled by various load balancing techniques ... -
Hard Drive Failure Prediction : A Rule Based Approach
(2011-07-12)The ability to accurately predict an impending hard disk failure is important for reliable storage system design. The facility provided by most hard drive manufacturers, called S.M.A.R.T. (self-monitoring, analysis and ...