Browsing Computer Science and Automation (CSA) by Title
Now showing items 160-179 of 377
-
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 ... -
Identification and Quantification of Important Voids and Pockets in Proteins
(2018-04-05)Many methods of analyzing both the physical and chemical behavior of proteins require information about its structure and stability. Also various other parameters such as energy function, solvation, hydrophobic/hydrophilic ... -
Identifying Method Memoization Opportunities in Java Programs
(2017-12-13)Memorization of a method is a commonly used re-factoring wherein developer modules the code of a method to save return values for some or all incoming parameter values. Whenever a parameter-tuple is received for the second ... -
Image Structures For Steganalysis And Encryption
(2013-10-21)In this work we study two aspects of image security: improper usage and illegal access of images. In the first part we present our results on steganalysis – protection against improper usage of images. In the second part ... -
IMAGINE : An Intelligent Electonic Marketplace
(Indian Institute of Science, 2007-01-16)In recent times, the Internet revolution has spawned numerous innovative enterprises-virtual companies, and electronic markets. Electronic markets (or digital markets) are scalable web-based platforms for buyers, sellers, ... -
An Implementation of Cross Architecture Procedure Call
(Indian Institute of Science, 2005-01-26)workstations are ideally suited for computing jobs which require an interactive environment because they are basically single user machines and hence provide consistent response time. Another factor is the availability ... -
Implementation Of Database Security Features Using Bit Matrices
(Indian Institute of Science, 2005-02-16)Information security is of utmost concern in a multiuser environment. The importance of security is felt much more with the widespread use of distributed database. Information is by itself a critical resource of an enterprise ... -
Improved Algorithms for Variants of Bin Packing and Knapsack
We study variants of two classical optimization problems: Bin Packing and Knapsack. Both bin packing and knapsack fall under the regime of "Packing and Covering Problems". In bin packing, we are given a set of input items, ...