Browsing Computer Science and Automation (CSA) by Title
Now showing items 320-339 of 354
-
Stochastic approximation with set-valued maps and Markov noise: Theoretical foundations and applications
Stochastic approximation algorithms produce estimates of a desired solution using noisy real world data. Introduced by Robbins and Monro, in 1951, stochastic approximation techniques have been instrumental in the asymptotic ... -
Stochastic Newton Methods With Enhanced Hessian Estimation
(2018-05-22)Optimization problems involving uncertainties are common in a variety of engineering disciplines such as transportation systems, manufacturing, communication networks, healthcare and finance. The large number of input ... -
Stochastic Optimization And Its Application In Reinforcement Learning
Numerous engineering fields, such as transportation systems, manufacturing, communication networks, healthcare, and finance, frequently encounter problems requiring optimization in the presence of uncertainty. Simulation-based ... -
Structured Regularization Through Convex Relaxations Of Discrete Penalties
Motivation. Empirical risk minimization(ERM) is a popular framework for learning predictive models from data, which has been used in various domains such as computer vision, text processing, bioinformatics, neuro-biology, ... -
Studies In Automatic Management Of Storage Systems
(2015-11-16)Autonomic management is important in storage systems and the space of autonomics in storage systems is vast. Such autonomic management systems can employ a variety of techniques depending upon the specific problem. In this ... -
A Study Of Quantum And Reversible Computing
(2013-07-31) -
A Study of the Performance Benefits of Controlling Parallel Asynochrous Iteractive Applications
(Indian Institute of Science, 2005-03-11)High performance networks of workstation are becoming increasingly popular a parallel computing platform because of their lower cost. Both message passing and software distributed shared memory (DSM) programming paradigms ... -
A Study of Thompson Sampling Approach for the Sleeping Multi-Armed Bandit Problem
(2018-05-29)The multi-armed 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
(2009-06-24)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
(2018-07-09)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
(2018-01-09)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 single-hop Question Answering (QA) system serve as useful modules in developing multi-hop Question Answering systems, mainly because the resulting QA system is interpretable and has been ... -
A Systems Perspective of Software Runtime Bloat - Origin, Mitigation and Power-Performance Implications
(2018-03-08)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 side-effect of ... -
Targeted Client Synthesis for Detecting Concurrency Bugs
(2018-01-01)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
(2018-04-03)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
(2017-05-21)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
(2010-02-11)Time management is one of the critical modules of safety-critical systems. Applications need strong assurance from the operating system that their hard real-time requirements are met. Partitioned system has recently evolved ... -
Top-k 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 Nisan-Wigderson Polynomial Family
(2018-07-09)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 Privacy-Preserving Two-Party k-Means Clustering Protocol
Two-party data mining is a win-win 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 two-party protocol. The need to ...