Computer Science and Automation (CSA): Recent submissions
Now showing items 181-200 of 391
-
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 ... -
Non-Parametric Clustering of Multivariate Count Data
(2018-05-23)The focus of this thesis is models for non-parametric clustering of multivariate count data. While there has been significant work in Bayesian non-parametric modelling in the last decade, in the context of mixture models ... -
Design of Quality Assuring Mechanisms with Learning for Strategic Crowds
(2018-05-23)In this thesis, we address several generic problems concerned with procurement of tasks from a crowd that consists of strategic workers with uncertainty in their qualities. These problems assume importance as the quality ... -
Incentive Design for Crowdfunding and Crowdsourcing Markets
(2018-05-23)With the ever-increasing trend in the number of social interactions getting intermediated by technology (the world wide web) as the backdrop, this thesis focuses on the design of mechanisms for online communities (crowds) ... -
Scalable Sprase Bayesian Nonparametric and Matrix Tri-factorization Models for Text Mining Applications
(2018-05-23)Hierarchical Bayesian Models and Matrix factorization methods provide an unsupervised way to learn latent components of data from the grouped or sequence data. For example, in document data, latent component corn-responds ... -
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 ... -
New Methods for Learning from Heterogeneous and Strategic Agents
(2018-05-21)1 Introduction In this doctoral thesis, we address several representative problems that arise in the context of learning from multiple heterogeneous agents. These problems are relevant to many modern applications such as ... -
Distributed TDMA-Scheduling and Schedule-Compaction Algorithms for Efficient Communication in Wireless Sensor Networks
(2018-05-16)A wireless sensor network (WSN) is a collection of sensor nodes distributed over a geographical region to obtain the environmental data. It can have different types of applications ranging from low data rate event driven ... -
Efficient Schemes for Improving the Performance of Clock Synchronization Protocols in Wireless Sensor Networks Using TDMA- based MAC Protocols
(2018-05-16)Clock synchronization in a wireless sensor network (WSN) is essential as it provides a consistent and a coherent time frame for all the nodes across the network. Typically, clock synchronization is achieved by message ... -
Grobuer Basis Algorithms for Polynomial Ideal Theory over Noetherian Commutative Rings
(2018-05-14)One of the fundamental problems in commutative algebra and algebraic geometry is to understand the nature of the solution space of a system of multivariate polynomial equations over a field k, such as real or complex ... -
Bayesian Nonparametric Modeling of Temporal Coherence for Entity-Driven Video Analytics
(2018-05-14)In recent times there has been an explosion of online user-generated video content. This has generated significant research interest in video analytics. Human users understand videos based on high-level semantic ... -
Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks
(2018-05-09)In this thesis, we consider stochastic systems which arise in different real-world application contexts. The first problem we consider is based on product adoption and pricing. A monopolist selling a product has to appropriately ... -
Algorithmic and Combinatorial Questions on Some Geometric Problems on Graphs
(2018-05-08)This thesis mainly focuses on algorithmic and combinatorial questions related to some geometric problems on graphs. In the last part of this thesis, a graph coloring problem is also discussed. Boxicity and Cubicity: These ... -
Efficient Algorithms for Structured Output Learning
(2018-05-08)Structured output learning is the machine learning task of building a classifier to predict structured outputs. Structured outputs arise in several contexts in diverse applications like natural language processing, computer ... -
Outlier Detection with Applications in Graph Data Mining
(2018-04-24)Outlier detection is an important data mining task due to its applicability in many contemporary applications such as fraud detection and anomaly detection in networks, etc. It assumes significance due to the general ... -
Improving Last-Level Cache Performance in Single and Multi-Core Processsors
(2018-04-23)With off-chip memory access taking 100's of processor cycles, getting data to the processor in a timely fashion remains one of the key performance bottlenecks in current systems. With increasing core counts, this problem ... -
Model-Checking in Presburger Counter Systems using Accelerations
(2018-04-18)Model checking is a powerful technique for analyzing reach ability and temporal properties of finite state systems. Model-checking finite state systems has been well-studied and there are well known efficient algorithms ...