Browsing Computer Science and Automation (CSA) by Title
Now showing items 9-28 of 552
-
Achieving practical secure non-volatile memory system with in-Memory Integrity Verification (iMIV)
Recent commercialization of Non-Volatile Memory (NVM) technology in the form of Intel Optane enables programmers to write recoverable programs. However, the data on NVM is susceptible to a plethora of data remanence attacks, ... -
Acyclic Edge Coloring Of Graphs
(2013-10-07)A proper edge coloring of G =(V,E)is a map c : E → C (where C is the set of available colors ) with c(e) ≠ c(ƒ) for any adjacent edges e,f. The minimum number of colors needed to properly color the edges of G, is called ... -
Adaptive Hierarchial RAID
(Indian Institute of Science, 2005-02-08)Redundant Arrays of Inexpensive Disks or RAID is a popular method of improving the reliability and performance of disk storage. Of various levels of RAID, mirrored or RAID1 and rotating parity or RAID5 configurations have ... -
An Adaptive Recompilation Framework For Rotor And Architectural Support For Online Program Instrumentation
(Indian Institute of Science, 2005-12-07)Although runtime systems and the dynamic compilation model have revolutionized the process of application development and deployment, the associated performance overheads continue to be a cause for concern and much research. ... -
Adaptive Selective Flooding Qos Routing
(Indian Institute of Science, 2005-02-08)The routing strategy used in today's Internet is best-effort service, where all data packets are treated equally. This type of service is not suited for applications such as video conferencing, and video on demand, that ... -
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 ... -
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 ... -
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 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 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 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 ...