Sciweavers

14235 search results - page 2744 / 2847
» Is computer science science
Sort
View
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 4 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 4 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 4 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
16 years 4 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
OSDI
2002
ACM
16 years 4 months ago
CMC: A Pragmatic Approach to Model Checking Real Code
Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of ex...
Madanlal Musuvathi, David Y. W. Park, Andy Chou, D...
« Prev « First page 2744 / 2847 Last » Next »