Search
Now showing items 11-20 of 29
Typestates and Beyond: Verifying Rich Behavioral Properties Over Complex Programs
Statically verifying behavioral properties of programs is an important research problem. An
efficient solution to this problem will have visible effects over multiple domains, ranging from
program development, program ...
An Evaluation of Basic Protection Mechanisms in Financial Apps on Mobile Devices
This thesis concerns the robustness of security checks in financial mobile applications (or simply
financial apps). The best practices recommended by OWASP for developing such apps demand
that developers include several ...
Operating System Support for Efficient Virtual Memory
Computers rely on the virtual memory abstraction to simplify programming, portability, physical memory management and ensure isolation among co-running applications. However, it creates a layer of indirection in the ...
Improved Algorithms for Variants of Bin Packing and Knapsack
We study variants of two classical optimization problems: Bin Packing and Knapsack. Both bin packing and knapsack fall under the regime of "Packing and Covering Problems". In bin packing, we are given a set of input items, ...
Analysis and Methods for Knowledge Graph Embeddings
Knowledge Graphs (KGs) are multi-relational graphs where nodes represent entities, and typed edges represent relationships among entities. These graphs store real-world facts such as (Lionel Messi, plays-for-team, Barcelona) ...
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 ...
Learning to Adapt Policies for uSD card
Machine Learning(ML) for Systems is a new and promising research area where performance
of computer systems is optimized using machine learning methods. ML for Systems has outperformed
traditional heuristics methods in ...
Algorithms for Fair Decision Making: Provable Guarantees and Applications
The topic of fair allocation of indivisible items has received significant attention because of its applicability in several real-world settings. This has led to a vast body of work focusing on defining appropriate fairness ...
Representing Networks: Centrality, Node Embeddings, Community Outliers and Graph Representation
Networks are ubiquitous. We start our technical work in this thesis by exploring the classical concept of node centrality (also known as influence measure) in information networks. Like clustering, node centrality is also ...
Algorithms for Social Good in Online Platforms with Guarantees on Honest Participation and Fairness
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 ...

