Computer Science and Automation (CSA): Recent submissions
Now showing items 321-340 of 547
-
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, ... -
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 ... -
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 ... -
Stochastic Approximation Algorithms with Set-valued Dynamics : Theory and Applications
(2018-07-05)Stochastic approximation algorithms encompass a class of iterative schemes that converge to a sought value through a series of successive approximations. Such algorithms converge even when the observations are erroneous. ... -
Ranking from Pairwise Comparisons : The Role of the Pairwise Preference Matrix
(2018-07-05)Ranking a set of candidates or items from pair-wise comparisons is a fundamental problem that arises in many settings such as elections, recommendation systems, sports team rankings, document rankings and so on. Indeed it ... -
Efficient Static Analyses for Concurrent Programs
(2018-06-29)Concurrent programs are pervasive owing to the increasing adoption of multi-core systems across the entire computing spectrum. However, the large set of possible program behaviors make it difficult to write correct and ... -
Polymage : Automatic Optimization for Image Processing Pipelines
(2018-06-25)Image processing pipelines are ubiquitous. Every image captured by a camera and every image uploaded on social networks like Google+or Facebook is processed by a pipeline. Applications in a wide range of domains like ... -
A Refinement-Based Methodology for Verifying Abstract Data Type Implementations
(2018-06-21)This thesis is about techniques for proving the functional correctness of Abstract Data Type (ADT) implementations. We provide a framework for proving the functional correctness of imperative language implementations of ... -
Number Theoretic, Computational and Cryptographic Aspects of a Certain Sequence of Arithmetic Progressions
(2018-06-21)This thesis introduces a new mathematical object: collection of arithmetic progressions with elements satisfying the inverse property, \j-th terms of i-th and (i+1)-th progressions are multiplicative inverses of each other ... -
Multi-label Classification with Multiple Label Correlation Orders And Structures
(2018-06-18)Multilabel classification has attracted much interest in recent times due to the wide applicability of the problem and the challenges involved in learning a classifier for multilabeled data. A crucial aspect of multilabel ... -
Efficient Whole Program Path Tracing
(2018-06-14)Obtaining an accurate whole program path (WPP) that captures a program’s runtime behaviour in terms of a control-flow trace has a number of well-known benefits, including opportunities for code optimization, bug detection, ... -
Automatic Optimization of Geometric Multigrid Methods using a DSL Approach
(2018-06-14)Geometric Multigrid (GMG) methods are widely used in numerical analysis to accelerate the convergence of partial differential equations solvers using a hierarchy of grid discretizations. These solvers find plenty of ... -
Concurrency Analysis and Mining Techniques for APIs
(2018-06-13)Software components expose Application Programming Interfaces (APIs) as a means to access their functionality, and facilitate reuse. Developers use APIs supplied by programming languages to access the core data structures ... -
Multimodal Deep Learning for Multi-Label Classification and Ranking Problems
(2018-06-11)In recent years, deep neural network models have shown to outperform many state of the art algorithms. The reason for this is, unsupervised pretraining with multi-layered deep neural networks have shown to learn better ... -
Optimization Algorithms for Deterministic, Stochastic and Reinforcement Learning Settings
(2018-05-30)Optimization is a very important field with diverse applications in physical, social and biological sciences and in various areas of engineering. It appears widely in ma-chine learning, information retrieval, regression, ... -
An Improved Lower Bound for Depth four Arithmetic Circuits
(2018-05-29)We study the problem of proving lower bounds for depth four arithmetic circuits. Depth four circuits have been receiving much attraction when it comes to recent circuit lower bound results, as a result of the series of ... -
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, ... -
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 ... -
Large Scale Graph Processing in a Distributed Environment
(2018-05-25)Graph algorithms are ubiquitously used across domains. They exhibit parallelism, which can be exploited on parallel architectures, such as multi-core processors and accelerators. However, real world graphs are massive in ... -
Fast Actively Secure OT Extension for Short Secrets
(2018-05-25)Oblivious Transfer (OT) is one of the most fundamental cryptographic primitives with wide-spread application in general secure multi-party computation (MPC) as well as in a number of tailored and special-purpose problems ...