The on-line advertising market involving displaying of Ads against search results by a search engine is growing at a fast rate. A majority of the search engine companies sell their advertising space through auctions which ...

Recent decades have seen a revolution in the way people communicate, buy products, learn new things, and share life experiences. This has spurred the growth of online platforms that enable users from all over the globe to ...

A Separation Kernel is a small specialized microkernel that provides a sand-boxed execution environment for a given set of processes (also called \subjects"). The subjects may communicate only via declared memory channels, ...

An m-variate polynomial f is affine equivalent to an n-variate polynomial g if m > n and there is a full rank n * m matrix A and a n-dimensional vector b such that f(x) = g(Ax + b). Given blackbox access to f and g (i.e ...

There is a need to protect mobile ad hoc network (MANET) from external attackers as well as internal attackers during route discovery and end-to-end key establishment. During route discovery, the external attackers can be ...

Biomolecules like proteins are the basic building blocks of living systems. It has been observed that the structure of a biomolecule plays an important role in defining its function. In this thesis, we describe novel ...

Crowdsourcing has emerged as a convenient mechanism to collect human judgments on a variety of tasks, ranging from document and image classification to scientific experimentation. However, in recent times crowdsourcing has ...

We consider the dueling bandits problem, a sequential decision task where the goal is to learn to pick `good' arms out of an available pool by actively querying for and observing relative preferences between selected pairs ...

In this work we study the multi-r-ic formula model introduced by [KS15c] and improve upon the lower bound for multi-r-ic depth four circuits given in [KST16b], when viewed as a function of the number of input variables ...

We study a host of geometric optimization problems that are NP-hard and design polynomial time approximation algorithms for them. More precisely, we are given a family of geometric objects and a point set, mostly in the ...