Search
Now showing items 81-90 of 142
Extending Program Analysis Techniques to Web Applications and Distributed Systems
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 ...
Problems on bend-number, circular separation dimension and maximum edge 2-colouring
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 ...
Structured Regularization Through Convex Relaxations Of Discrete Penalties
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, ...
Adaptively Secure Primitives in the Random Oracle Model
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 ...
Guarding Terrain using k-Watchtowers
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 ...
Dynamics of a Stratified Population of Optimum Seeking Agents on a Network
Very large scale multi-agent systems occur both naturally and in engineering applications. In many of these systems, the agents are either selfish or act with varying levels of coordination. Understanding the evolution of ...
Novel Reinforcement Learning Algorithms and Applications to Hybrid Control Design Problems
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 ...
Towards Effcient Privacy-Preserving Two-Party k-Means Clustering Protocol
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 ...
Revisiting Statistical Techniques for Result Cardinality Estimation
The Relational Database Management Systems (RDBMS) constitute the backbone of today's information-rich society, providing a congenial environment for handling enterprise data during its entire life cycle of generation, ...
Honest Majority and Beyond: Efficient Secure Computation over Small Population
Secure Multi-Party Computation for small population has witnessed notable practically-efficient works
in the setting of both honest majority and dishonest majority. While honest majority provides the promise
of stronger ...

