Browsing Computer Science and Automation (CSA) by thesis submitted date"2016"
Now showing items 1-20 of 21
-
Automatic Storage Optimization of Arrays Affine Loop Nests
(2018-03-01)Efficient memory usage is crucial for data-intensive applications as a smaller memory footprint ensures better cache performance and allows one to run a larger problem size given a axed amount of main memory. The solutions ... -
A Case for Protecting Huge Pages from the Kernel
(2018-01-01)Modern architectures support multiple size pages to facilitate applications that use large chunks of contiguous memory either for buffer allocation, application specific memory management, in-memory caching or garbage ... -
Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model
(2018-01-01)Hypergraph partitioning lies at the heart of a number of problems in machine learning as well as other engineering disciplines. While partitioning uniform hypergraphs is often required in computer vision problems that ... -
Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control
(2017-09-20)Many sequential decision making problems under uncertainty arising in engineering, science and economics are often modelled as Markov Decision Processes (MDPs). In the setting of MDPs, the goal is to and a state dependent ... -
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 ... -
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 ... -
Learning with Complex Performance Measures : Theory, Algorithms and Applications
(2017-12-07)We consider supervised learning problems, where one is given objects with labels, and the goal is to learn a model that can make accurate predictions on new objects. These problems abound in applications, ranging from ... -
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 ... -
New Models and Methods for Formation and Analysis of Social Networks
Social networks are an inseparable part of human lives, and play a major role in a wide range of activities in our day-to-day as well as long-term lives. The rapid growth of online social networks has enabled people to ... -
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 ... -
On Learning k-Parities and the Complexity of k-Vector-SUM
(2018-02-06)In this work, we study two problems: first is one of the central problem in learning theory of learning sparse parities and the other k-Vector-SUM is an extension of the not oriousk-SUM problem. We first consider the problem ... -
Plan Bouquets : An Exploratory Approach to Robust Query Processing
(2017-09-26)Over the last four decades, relational database systems, with their mathematical basis in first-order logic, have provided a congenial and efficient environment to handle enterprise data during its entire life cycle of ... -
Power Issues in SoCs : Power Aware DFT Architecture and Power Estimation
(2018-01-10)Test power, data volume, and test time have been long-standing problems for sequential scan based testing of system-on-chip (SoC) design. The modern SoCs fabricated at lower technology nodes are complex in nature, the ... -
Precise Analysis of Private And Shared Caches for Tight WCET Estimates
(2017-10-31)Worst Case Execution Time (WCET) is an important metric for programs running on real-time systems, and finding precise estimates of a program’s WCET is crucial to avoid over-allocation and wastage of hardware resources and ... -
Provable Methods for Non-negative Matrix Factorization
(2017-10-31)Nonnegative matrix factorization (NMF) is an important data-analysis problem which concerns factoring a given d n matrix A with nonnegative entries into matrices B and C where B and C are d k and k n with nonnegative ... -
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 ... -
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
(2017-12-16)In many real world situations, especially involving multiagent systems and artificial intelligence, participating agents often need to agree upon a common alternative even if they have differing preferences over the available ... -
Retweet Profiling - Study Dissemination of Twitter Messages
(2017-09-23)Social media has become an important means of everyday communication. It is a mechanism for “sharing” and “resharing” of information. While social network platforms provide the means to users for resharing/reblogging (aka ... -
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. ... -
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 ...