6251 search results - page 443 / 1251 » Randomness, Computability, and Density |
200
click to vote
RANDOM
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
183
Voted
SIGGRAPH
1998
ACM
15 years 11 months ago
1998
ACM
We describe a system that automatically generates varied geometric models of human faces. A collection of random measurements of the face is generated according to anthropometric ...
171
click to vote
FOCS
1992
IEEE
15 years 11 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
152
click to vote
SPAA
1992
ACM
15 years 11 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
163
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...