Browsing Computer Science and Automation (CSA) by Title
Now showing items 56-75 of 394
-
Bounds On Augmented Automata And Quantum Adiabatic Optimization
(2009-05-25)Quantum computing has generated a lot of interested in the past two decades. Research into powerful models of quantum computation has yielded important and elegant results like an efficient algorithm for factoring and a ... -
Boxicity And Cubicity : A Study On Special Classes Of Graphs
(2014-06-02)Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping f : V (G)→ F such that, An interval graph is an intersection graph of a family of closed intervals on the ... -
Boxicity, Cubicity And Vertex Cover
(2010-09-28)The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding ... -
A Broadcast Cube-Based Multiprocessor Architecture for Solving Partial Differential Equations
(Indian Institute of Science, 2005-01-26)A large number of mathematical models in engineering and physical sciences employ Partial Differential Equations (PDEs). The sheer number of operations required in numerically integrating PDEs in these applications has ... -
Caching Techniques For Dynamic Web Servers
(2009-03-20)Websites are shifting from static model to dynamic model, in order to deliver their users with dynamic, interactive, and personalized experiences. However, dynamic content generation comes at a cost – each request ... -
A Case for Protecting Huge Pages from the Kernel
(2018-01-01)Modern architectures support multiple size pages to facilitate applications that use large chunks of contiguous memory either for buffer allocation, application specific memory management, in-memory caching or garbage ... -
Checking Compatability of Programs on Shared Data
(2018-07-28)A large software system is built by composing multiple programs, possibly developed independently. The component programs communicate by sharing data. Data sharing involves creation of instances of the shared data by one ... -
Checking Observational Purity of Procedures
We provide two static analysis approaches(using theorem proving) that check if a given (recursive) procedure behaves as if it were stateless, even when it maintains state in global variables. In other words, we check if ... -
Cluster Identification : Topic Models, Matrix Factorization And Concept Association Networks
(2013-09-17)The problem of identifying clusters arising in the context of topic models and related approaches is important in the area of machine learning. The problem concerning traversals on Concept Association Networks is of great ... -
CodeQueries: Benchmarking Query Answering over Source Code
Software developers often make queries about the security, performance effectiveness, and maintainability of their code. Through an iterative debugging process, developers analyze the code to find answers to these ... -
Combinatorial Problems arising in Quantum Physics and Model counting
This thesis investigates some combinatorial problems arising in quantum physics and model counting. In particular, we develop new graph-theoretic techniques to resolve some open questions from quantum photonics. We also ... -
Comparative Analysis of Topological Structures
Measuring scientific processes result in a set of scalar functions (scalar fields) which may be related temporally, be part of an ensemble, or unrelated. Overall understanding and visualization of scientific processes ... -
Compilation of Graph Algorithms for Hybrid, Cross-Platform and Distributed Architectures
(2018-07-09)1. Main Contributions made by the supplicant: This thesis proposes an Open Computing Language (OpenCL) framework to address the challenges of implementation of graph algorithms on parallel architectures and large scale ... -
A Compiler and Symbolic Debugger for Occam
(Indian Institute of Science, 2005-03-03)We have implemented Occam, a parallel programming language, on a uniprocessor machine (MC-68020 based HORIZON I11 running on UNIX system V.2) with simulated concurrency. Occam is a descendant of CSP with a few convenient ... -
Compiler Assisted Energy Management For Sensor Network Nodes
(2010-08-16)Emerging low power, embedded, wireless sensor devices are useful for wide range of applications, yet have very limited processing storage and especially energy resources. Sensor networks have a wide variety of applications ...