Search
Now showing items 291-300 of 377
An Improved Lower Bound for Multi-r-ic Depth Four Circuits as a Function of the Number of Input Variables
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 ...
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 ...
Deep Learning with Minimal Supervision
Abstract
In recent years, deep neural networks have achieved extraordinary performance on supervised learning tasks. Convolutional neural networks (CNN) have vastly improved the state of the art for most computer vision ...
Program Repair by Automated Generation of Hints
Programming has become an important skill in today's technology-driven world. It is a complex activity because of which programmers make mistakes in their software. Student programmers make mistakes in their programs due ...
Computing Contour Tress for 2D Piecewise Polynomial Functions
Contour trees are extensively used in scalar field analysis. The contour tree is a data structure that tracks the evolution of level set topology in a scalar field. Scalar fields are typically available as samples at ...
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 ...
Program Analyses to Support Memory-saving Refactorings in Java Programs
Software commonly consumes unexpectedly high amounts of memory, frequently due to programming idioms that are used to make software more reliable, maintainable and understandable. In the case of modern object-oriented ...
Algorithms for Stochastic Optimization, Statistical Estimation and Markov Decision Processes
Stochastic approximation deals with the problem of finding zeros of a function expressed as an expectation
of a random variable. In this thesis we propose convergent algorithms for problems in
optimization, statistical ...