Search
Now showing items 181-190 of 195
A Nash Bargaining Based Bid Optimizer for Sponsored Search Auctions
The on-line advertising market involving displaying of Ads against search results by a search engine is growing at a fast rate. A majority of the search engine companies sell their advertising space through auctions which ...
Efficient Key Management Protocols for Secure Routing and End-to-End Key Establishment with Enhanced Security in Mobile Ad hoc Networks
There is a need to protect mobile ad hoc network (MANET) from external attackers as well as internal attackers during route discovery and end-to-end key establishment. During route discovery, the external attackers can be ...
Learning Tournament Solutions from Preference-based Multi-Armed Bandits
We consider the dueling bandits problem, a sequential decision task where the goal is to learn to pick `good' arms out of an available pool by actively querying for and observing relative preferences between selected pairs ...
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 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 ...
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 ...
Expanders in Arithmetic Circuit Lower Bound : Towards a Separation Between ROABPs and Multilinear Depth 3 Circuits
Consider the problem of Polynomial Identity Testing(PIT): we are given an arithmetic circuit
computing a multivariate polynomial over some eld and we have to determine whether that
polynomial is identically zero or not. ...
Efficient Schemes for Partitioning Based Scheduling of Real-Time Tasks in Multicore Architecture
The correctness of hard real-time systems depends not only on its logical correctness but also, on its ability to meet all its deadline. Existing real-time systems use either a pure real-time scheduler or a real-time ...