Browsing Computer Science and Automation (CSA) by Title
Now showing items 327346 of 354

A Study of Thompson Sampling Approach for the Sleeping MultiArmed Bandit Problem
(20180529)The multiarmed bandit (MAB) problem provides a convenient abstraction for many online decision problems arising in modern applications including Internet display advertising, crowdsourcing, online procurement, smart grids, ... 
Superscalar Processor Models Using Statistical Learning
(20090624)Processor architectures are becoming increasingly complex and hence architects have to evaluate a large design space consisting of several parameters, each with a number of potential settings. In order to assist in guiding ... 
Supervised Classification of Missense Mutations as Pathogenic or Tolerated using Ensemble Learning Methods
(20180709)Missense mutations account for more than 50% of the mutations known to be involved in human inherited diseases. Missense classification is a challenging task that involves sequencing of the genome, identifying the variations, ... 
Symmetry in Scalar Fields
(20180109)Scalar fields are used to represent physical quantities measured over a domain of interest. Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights ... 
A Syntactic Neural Model For Question Decomposition
Question decomposition along with singlehop Question Answering (QA) system serve as useful modules in developing multihop Question Answering systems, mainly because the resulting QA system is interpretable and has been ... 
A Systems Perspective of Software Runtime Bloat  Origin, Mitigation and PowerPerformance Implications
(20180308)Large flexible software systems tend to incur “bloat”, here defined as the runtime overhead induced by the accumulation of excess functionality and objects. Removing bloat is hard as these overheads are a sideeffect of ... 
Targeted Client Synthesis for Detecting Concurrency Bugs
(20180101)Detecting concurrency bugs can be challenging due to the intricacies associated with their manifestation. These intricacies correspond to identifying the methods that need to be invoked concurrently, the inputs passed to ... 
A Theoretical Study of the Synergy and Lazy Annotation Algorithms
(20180403)Given a program with assertions, the assertion checking problem is to tell whether there is an execution of the program that violates one of the assertions. One approach to this problem is to explore different paths towards ... 
Tiling Stencil Computations To Maximize Parallelism
(20170521)Stencil computations are iterative kernels often used to simulate the change in a discretized spatial domain overtime (e.g., computational fluid dynamics) or to solve for unknowns in a discretized space by converging to a ... 
Time Management In Partitioned Systems
(20100211)Time management is one of the critical modules of safetycritical systems. Applications need strong assurance from the operating system that their hard realtime requirements are met. Partitioned system has recently evolved ... 
Topk Spatial Aware Ads
Consider an app on a smartphone which displays local business ads. When a user opens the app, then k local business ads need to displayed (where k would typically be 3 or 5) such that the profit made by the app is ... 
Towards a Charcterization of the Symmetries of the NisanWigderson Polynomial Family
(20180709)Understanding the structure and complexity of a polynomial family is a fundamental problem of arithmetic circuit complexity. There are various approaches like studying the lower bounds, which deals with nding the smallest ... 
Towards Effcient PrivacyPreserving TwoParty kMeans Clustering Protocol
Twoparty data mining is a winwin game if played with a guarantee of data privacy from each other. This guarantee is provided by the use of cryptographic techniques in designing the twoparty protocol. The need to ... 
Towards Secure and Efficient Realization of PairingBased Signatures from Static Assumptions.
Bilinear pairing defined over elliptic curve group was first used to design novel cryptosystem in 2000. Since then a large number of cryptosystems has been proposed in pairingbased cryptography (PBC). The main tool for ... 
Transducerbased Algorithmic Verification of Retransmission Protocols over Noisy Channels
(20180405)Unreliable communication channels are a practical reality. They add to the complexity of protocol design and verification. In this work, we consider noisy channels which can corrupt messages. We present an approach to model ... 
TriSL: A Software Architecture Description Language and Environment
(Indian Institute of Science, 20050314)As the size and complexity of a software system increases, the design problem goes beyond the algorithms and data structures of the computation. Designing and specifying the overall system structure  or software architecture ... 
A TrustedHardware Backed Secure Payments Platform for Android
Digital payments using personal electronic devices have been steadily gaining in popularity for the last few years. While digital payments using smartphones are very convenient, they are also more susceptible to security ... 
Two Player Game Variant Of The Erdos Szekeres Problem
(20140801)The following problem has been known for its beauty and elementary character. The Erd˝os Szekeres problem[7]: For any integer k ≥ 3, determine if there exists a smallest positive integer N(k) such that any set of atleast ... 
Typestates and Beyond: Verifying Rich Behavioral Properties Over Complex Programs
Statically verifying behavioral properties of programs is an important research problem. An efficient solution to this problem will have visible effects over multiple domains, ranging from program development, program ... 
A Unified Approach to Quantitative Software Lifecycle Modeling
(Indian Institute of Science, 20050406)An evolutionary process currently taking place in engineering systems is the shift from hardware to software where the role of software engineering is becoming more central in developing large engineering systems. This ...