Sciweavers

27274 search results - page 5002 / 5455
» A framework for framework documentation
Sort
View
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
16 years 7 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
16 years 7 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 7 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
OSDI
2008
ACM
16 years 7 months ago
Carnegie Mellon's CyDAT: Harnessing a Wide Array of Telemetry Data to Enhance Distributed System Diagnostics
The number and complexity of distributed applications has exploded, and to-date, each has had to create its own method for providing diagnostic tools and performance metrics. Thes...
Chas DiFatta, Mark Poepping, Daniel V. Klein
OSDI
2006
ACM
16 years 7 months ago
From Uncertainty to Belief: Inferring the Specification Within
Automatic tools for finding software errors require a set of specifications before they can check code: if they do not know what to check, they cannot find bugs. This paper presen...
Ted Kremenek, Paul Twohey, Godmar Back, Andrew Y. ...
« Prev « First page 5002 / 5455 Last » Next »