Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Title
Now showing items 46-65 of 1659
-
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 ... -
Algorithms for Fair Decision Making: Provable Guarantees and Applications
The topic of fair allocation of indivisible items has received significant attention because of its applicability in several real-world settings. This has led to a vast body of work focusing on defining appropriate fairness ... -
Algorithms for Geometric Packing and Covering Problems
We study two fundamental problems related to geometric packing and covering, and design algorithms with improved worst-case performance guarantees for them. These problems have numerous applications in resource allocation, ... -
Algorithms for Homogeneous Quadratic Minimization And Applications in Wireless Networks
(2017-11-09)Massive proliferation of wireless devices throughout world in the past decade comes with a host of tough and demanding design problems. Noise at receivers and wireless interference are the two major issues which severely ... -
Algorithms for Multilingual IR in Low Resource Languages using Weakly Aligned Corpora
Multilingual information retrieval (MLIR) methods generally rely on linguistic resources such as dictionaries, parallel corpora, etc., to overcome the language barrier. For low resource languages without these resources, ... -
Algorithms for Online Learning in Structured Environments
Online learning deals with the study of making decisions sequentially using information gathered along the way. Typical goals of an online learning agent can be to maximize the reward gained during learning or to identify ... -
Algorithms for processing polarization-rich optical imaging data
(Indian Institute of Science, 2005-04-13)This work mainly focuses on signal processing issues related to continuous-wave, polarization-based direct imaging schemes. Here, we present a mathematical framework to analyze the performance of the Polarization Difference ...