Sciweavers

1413 search results - page 260 / 283
» A Theory for Memory-Based Learning
Sort
View
POPL
2007
ACM
16 years 4 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 4 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
POPL
2010
ACM
16 years 1 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
ICS
2010
Tsinghua U.
16 years 1 months ago
Space-Efficient Estimation of Robust Statistics and Distribution Testing
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
Steve Chien, Katrina Ligett, Andrew McGregor
IUI
2010
ACM
16 years 1 months ago
The why UI: using goal networks to improve user interfaces
People interact with interfaces to accomplish goals, and knowledge about human goals can be useful for building intelligent user interfaces. We suggest that modeling high, human-l...
Dustin Arthur Smith, Henry Lieberman