Search
Now showing items 41-50 of 106
Embedding Networks: Node and Graph Level Representations
Graph neural networks gained significant attention for graph representation and classification in the machine learning community. For graph classification, different pooling techniques are introduced, but none of them has ...
On Learning and Lower Bound Problems Related to the Iterated Matrix Multiplication Polynomial
The iterated matrix multiplication polynomial (IMM) of width w and length d is the 1x1 entry in the product of d square matrices of size w. The w^2d entries in the d matrices are distinct variables. In this thesis, we study ...
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 ...
Verification of a Generative Separation Kernel
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, ...
Deep Learning Models for Few-shot and Metric Learning
Deep neural network-based models have achieved unprecedented performance levels over many tasks in the traditional supervised setting and scale well with large quantities of data. On the other hand, improving performance ...
Geometric and Topological Methods for Biomolecular Visualization
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 ...
Deep Learning for Bug Localization and Program Repair
In this thesis, we focus on the problem of program debugging and present novel deep learning
based techniques for bug-localization and program repair. Deep learning techniques have been
successfully applied to a variety ...
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 ...
Efficient and Secure Search over Encrypted Data
Due to a variety of crucial bene fits, enterprises outsource their data to cloud resident storage. The
outsourced data needs to be stored in encrypted form on remote untrusted servers to preserve privacy.
However, if the ...
Towards Secure and Efficient Realization of Pairing-Based Signatures from Static Assumptions.
Bilinear pairing defined over elliptic curve group was first used to design novel cryptosystem in 2000. Since then a large number of cryptosystems has been proposed in pairing-based cryptography (PBC). The main tool for ...