Search
Now showing items 31-40 of 106
Checking Observational Purity of Procedures
We provide two static analysis approaches(using theorem proving) that check if a given (recursive)
procedure behaves as if it were stateless, even when it maintains state in global variables.
In other words, we check if ...
Novel First-order Algorithms for Non-smooth Optimization Problems in Machine Learning
This thesis is devoted to designing efficient optimization algorithms for machine learning (ML) problems where the underlying objective function to be optimized is convex but not necessarily differentiable. Such non-smooth ...
2-Level Page Tables (2-LPT): A Building Block for Efficient Address Translation in Virtualized Environments
Efficient address translation mechanisms are gaining more and more attention as the virtual
address range of the processors keeps expanding and the demand for machine virtualization
increases with cloud and data center-based ...
Comparative Analysis of Topological Structures
Measuring scientific processes result in a set of scalar functions (scalar fields) which may be related temporally, be part of an ensemble, or unrelated. Overall understanding and visualization of scientific processes ...
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 ...
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 ...
Boolean Functional Synthesis using Gated Continuous Logic Networks
Boolean Functional Synthesis (BFS) is a well-known challenging problem in the domain of automated program synthesis from logical specifications. This problem aims to synthesize a Boolean function that is correct-by-construction ...
Fully Resilient Non-Interactive ID-Based Hierarchical Key Agreement
Non-Interactive Key Agreement (NIKA) is a cryptographic primitive which allows two parties to agree on a shared secret key without any interaction. Identity-based Non-Interactive Key Agreement (ID-NIKA) allows each party ...
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 ...