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 ...

Web-based applications and distributed systems are ubiquitous and indispensable today. These systems use multiple parallel machines for greater functionality, and efficient and reliable computation. At the same time they ...

Representation of graphs as the intersection graphs of geometric objects has a long history. The objective is to a nd a collection of \simple" sets S such that a given graph G is its intersection graph. We are interested ...

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, ...

Adaptive security embodies one of the strongest notions of security that allows an adversary to corrupt parties at any point during protocol execution and gain access to its internal state. Since it models reallife situations ...

The discrete k-watchtower problem for a polyhedral terrain T in R3 with n vertices is to nd k vertical segments, called watchtowers, of smallest height, whose bottom end-points (bases) lie on some vertices of T, and ...

Digital payments using personal electronic devices have been steadily gaining in popularity for the last few years. While digital payments using smartphones are very convenient, they are also more susceptible to security ...

The thesis is a compilation of two independent works. In the first work, we develop novel weight assignment procedure, which helps us develop several schedule based algorithms. Learning the value function of a given policy ...

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 ...

Non-malleable secret sharing (NMSS) schemes, introduced by Goyal and Kumar (STOC 2018), ensure that a secret m can be distributed into shares m1,...,mn (for some n), such that any t (a parameter <= n) shares can be ...