Browsing Computer Science and Automation (CSA) by Title
Now showing items 140-159 of 354
-
Generalization of Hitting, Covering and Packing Problems on Intervals
(2018-05-29)Interval graphs are well studied structures. Intervals can represent resources like jobs to be sched-uled. Finding maximum independent set in interval graphs would correspond to scheduling maximum number of non-conflicting ... -
Generalizations Of The Popular Matching Problem
(2013-07-02)Matching problems arise in several real-world scenarios like assigning posts to applicants, houses to trainees and room-mates to one another. In this thesis we consider the bipartite matching problem where one side of the ... -
Geometric and Topological Methods for Biomolecular Visualization
Biomolecules like proteins are the basic building blocks of living systems. It has been observed that the structure of a biomolecule plays an important role in defining its function. In this thesis, we describe novel ... -
A GPU Accelerated Tensor Spectral Method for Subspace Clustering
(2017-11-30)In this thesis we consider the problem of clustering the data lying in a union of subspaces using spectral methods. Though the data generated may have high dimensionality, in many of the applications, such as motion ... -
Graph Models For Query Focused Text Summarization And Assessment Of Machine Translation Using Stopwords
(2014-04-09)Text summarization is the task of generating a shortened version of the original text where core ideas of the original text are retained. In this work, we focus on query focused summarization. The task is to generate the ... -
Grobuer Basis Algorithms for Polynomial Ideal Theory over Noetherian Commutative Rings
(2018-05-14)One of the fundamental problems in commutative algebra and algebraic geometry is to understand the nature of the solution space of a system of multivariate polynomial equations over a field k, such as real or complex ... -
Guarding Terrain using k-Watchtowers
The discrete k-watchtower problem for a polyhedral terrain T in R3 with n vertices is to nd k vertical segments, called watchtowers, of smallest height, whose bottom end-points (bases) lie on some vertices of T, and ... -
Hadwiger's Conjecture On Circular Arc Graphs
(2009-04-30)Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph theory. Hadwiger’s conjecture states that if the chromatic number of a graph G is k, then G has a clique minor of size at ... -
Handling Overloads with Social Consistency
Cloud computing applications have dynamic workloads, and they often observe spikes in the incoming traffic which might result in system overloads. System overloads are generally handled by various load balancing techniques ... -
Hard Drive Failure Prediction : A Rule Based Approach
(2011-07-12)The ability to accurately predict an impending hard disk failure is important for reliable storage system design. The facility provided by most hard drive manufacturers, called S.M.A.R.T. (self-monitoring, analysis and ... -
Heterogeneity Aware Shared DRAM Cache for Integrated Heterogeneous Architectures
Integrated Heterogeneous System (IHS) processors pack throughput-oriented GPGPUs along-side latency-oriented CPUs on the same die sharing certain resources, e.g., shared last level cache, network-on-chip (NoC), and the ... -
Hierarchical Data Structures for Pattern Recognition
(Indian Institute of Science, 2005-02-22)Pattern recognition is an important area with potential applications in computer vision, Speech understanding, knowledge engineering, bio-medical data classification, earth sciences, life sciences, economics, psychology, ... -
High Performance GPU Tensor Core Code Generation for Matmul using MLIR
State of the art in high-performance deep learning is primarily driven by highly tuned libraries. These libraries are often hand-optimized and tuned by expert programmers using low-level abstractions with significant effort. ... -
Hitting Geometric Range Spaces using a Few Points
(2018-02-15)A range space (P, S) consists of a set P of n elements and a collection S = {S1,...,Sm} of subsets of P , referred to as ranges. A hitting set for this range space refers to a subset H of P such that every Si in S contains ... -
Honest Majority and Beyond: Efficient Secure Computation over Small Population
Secure Multi-Party Computation for small population has witnessed notable practically-efficient works in the setting of both honest majority and dishonest majority. While honest majority provides the promise of stronger ... -
HYDRA: A Dynamic Approach to Database Regeneration
Database software vendors often need to generate synthetic databases for a variety of applications, including (a) Testing database engines and applications, (b) Data masking, (c) Benchmarking, (d) Creating what-if scenarios, ... -
Hypergraph Network Models: Learning, Prediction, and Representation in the Presence of Higher-Order Relations
The very thought about “relating” objects makes us assume the relation would be “pairwise”, and not of a “higher-order” — involving possibly more than two of them at a time. Yet in reality, higher-order relations do exist ... -
Hyperplane Partitioning : An Approach To Global Data Partitioning For Distributed Memory Machines
(Indian Institute of Science, 2005-12-07)Automatic Global Data Partitioning for Distributed Memory Machines (DMMs) is a difficult problem. Distributed memory machines are scalable, but since the memory is distributed across processors, the scheme of placement ...