Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Title
Now showing items 39-58 of 1659
-
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 ... -
Algorithms for Achieving Fairness and Efficiency in Matching Problems
Matching problems arise in numerous practical settings. Fairness and efficiency are two desirable properties in most such real world scenarios. This dissertation work presents new approaches and models for capturing and ... -
Algorithms for Adjusted Load Flow Solutions using the Complementarity Principle
The state of a given power system i.e. voltage magnitudes and angles at all the buses can be computed using the Newton-Raphson Load Flow (NRLF) method when active power and reactive power loads are specified at all the ... -
Algorithms for Challenges to Practical Reinforcement Learning
Reinforcement learning (RL) in real world applications faces major hurdles - the foremost being safety of the physical system controlled by the learning agent and the varying environment conditions in which the autonomous ... -
Algorithms for coloring random and semi-random graphs
The graph coloring problem is NP-hard and arises in a variety of practical situations. Recent breakthroughs in the area of approximation complexity indicate that it is not possible (unless P = NP) even to approximate the ... -
Algorithms For Efficient Implementation Of Secure Group Communication Systems
(2007-10-23)A distributed application may be considered as a set of nodes which are spread across the network, and need to communicate with each other. The design and implementation of these distributed applications is greatly simplified ... -
Algorithms for Fair Clustering
Many decisions today are taken by various machine learning algorithms, hence it is crucial to accommodate fairness in such algorithms to remove/reduce any kind of bias in the decision. We incorporate fairness in the ...