17329 search results - page 3201 / 3466 » Improved non-approximability results |
187
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
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...
181
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
176
click to vote
OSDI
2008
ACM
16 years 7 months ago
2008
ACM
Abstract ? Large enterprise networks consist of thousands of services and applications. The performance and reliability of any particular application may depend on multiple service...
186
click to vote
OSDI
2002
ACM
16 years 7 months ago
2002
ACM
This paper shows how to quickly move the state of a running computer across a network, including the state in its disks, memory, CPU registers, and I/O devices. We call this state...
218
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...