Search
Now showing items 41-50 of 72
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 ...
Matching Domain Model with Source Code using Relationships
(2018-01-30)
We address the task of mapping a given domain model (e.g., an industry-standard reference model) for a given domain (e.g., ERP), with the source code of an independently developed application in the same domain. This has ...
Variants and Generalization of Some Classical Problems in Combinatorial Geometry
(2018-02-18)
In this thesis we consider extensions and generalizations of some classical problems
in Combinatorial Geometry. Our work is an offshoot of four classical problems in
Combinatorial Geometry. A fundamental assumption in these ...
Bayes Optimal Feature Selection for Supervised Learning
(2018-02-18)
The problem of feature selection is critical in several areas of machine learning and data analysis such as, for example, cancer classification using gene expression data, text categorization, etc. In this work, we consider ...
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 ...
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, ...
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) ...
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 ...
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 ...
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 ...