Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Title
Now showing items 33-52 of 1659
-
Adaptively Secure Primitives in the Random Oracle Model
Adaptive security embodies one of the strongest notions of security that allows an adversary to corrupt parties at any point during protocol execution and gain access to its internal state. Since it models reallife situations ... -
Addressing Energy and Performance Related Challenges in Networked Embedded Systems
Networked Embedded Systems comprise of spatially and functionally distributed nodes that are interconnected with one another and with the environment to achieve certain goals. The nodes are connected to one another through ... -
Addressing the Performance and Reliability Bottlenecks in 2D Transition Metal Dichalcogenide (TMD) Based Transistor Technology
In this thesis, we presented different contributions towards the development of 2D material technology. Firstly the realization of desired dimensions over singlecrystal high-quality MoS2 material through dry etching ... -
Adjacent Independent Row (Air) Matrices and Index Coding
An index coding problem, comprises a transmitter that has a set of independent messages and a set of receivers. Each receiver knows a subset of messages, called its side-information, and demands another subset of messages, ... -
Advancing the Communication Complexity Landscape of Perfectly Secure Multiparty Computation
Secure multiparty computation (MPC) allows n distrustful parties to jointly compute a function on their inputs while keeping their inputs private. The distrust is modelled as an adversary that controls up to t parties and ... -
AlGaN/GaN Heterojunction Based Hall Sensors for Magnetic Field Sensing over Wide Temperature Range
Hall sensor has proved to be an attractive solution for sensing requirements in electric machines for direct measurement of fields or indirect estimation of physical quantities such as current, speed and torque. Current ... -
Algebraic Techniques for Error Correction in Random Networks
Abstract The transmission of data in the presence of errors and erasures over random networks, in situations where there is only partial information regarding the underlying network topology, has been interpreted in ... -
Algorithm And Architecture Design for Real-time Face Recognition
(2017-10-31)Face recognition is a field of biometrics that deals with identification of subjects based on features present in the images of their faces. The factors that make face recognition popular and favorite as compared to other ... -
Algorithm-Architecture Co-Design for Dense Linear Algebra Computations
(2018-08-13)Achieving high computation efficiency, in terms of Cycles per Instruction (CPI), for high-performance computing kernels is an interesting and challenging research area. Dense Linear Algebra (DLA) computation is a representative ... -
Algorithmic and architectural solutions for scheduling task graphs on multiprocessors
Scheduling is a critical challenge in the design of multicomputer systems, especially for minimizing execution time of parallel programs represented as task graphs. This thesis presents both algorithmic and architectural ... -
Algorithmic and Combinatorial Questions on Some Geometric Problems on Graphs
(2018-05-08)This thesis mainly focuses on algorithmic and combinatorial questions related to some geometric problems on graphs. In the last part of this thesis, a graph coloring problem is also discussed. Boxicity and Cubicity: These ... -
An Algorithmic Approach To Some Matrix Equivalence Problems
(2010-06-09)The analysis of similarity of matrices over fields, as well as integral domains which are not fields, is a classical problem in Linear Algebra and has received considerable attention. A related problem is that of simultaneous ... -
An Algorithmic Characterization Of Polynomial Functions Over Zpn
(2014-07-04)The problem of polynomial representability of functions is central to many branches of mathematics. If the underlying set is a finite field, every function can be represented as a polynomial. In this thesis we consider ... -
Algorithmic knowledge for a knowledge-based clustering environment.
Clustering is a process of partitioning a given set of objects into meaningful groups. It has potential applications in many areas, including: 1.Image Segmentation, 2. Speech/speaker Classification, 2.ECG Classificati ... -
Algorithmic Problems on Vertex Deletion and Graph Coloring
In the thesis, we mainly discuss variants of two well-studied graph theoretical problems - vertex deletion problem and graph coloring problem - both have been used to tackle many real-world problems in diverse fields. Vertex ... -
Algorithmic studies on graph domination -refinements and extensions
Given a graph G = (V, E), where V is a finite set of vertices and E is the set of edges, a set D ? V of vertices is a dominating set if every vertex in V ? D is adjacent to some vertex in D. The size of a minimum cardinality ... -
Algorithms and characterizations for subclasses of planar perfect graphs
In this thesis, we consider two major subclasses of planar perfect graphs. We exploit certain decomposability and ordering properties to develop new characterizations and efficient algorithms. We study the Hamiltonian cycle ... -
Algorithms and lower bounds for graph connectivity and covering
Graph Connectivity is a well-studied problem, and its time complexity is well understood. However, its space complexity remains a mystery. Closely related to the space complexity of connectivity is the problem of derandomizing ... -
Algorithms And Models For Debugging Distributed Programs
(2012-05-04) -
Algorithms and Testbed for Synchronous Generator Parameter Estimation
The development of dynamic power system component models became increasingly important in the modern grids dominated by high penetration of renewables because of the increased dependency of planning and operational decisions ...