932 search results - page 77 / 187 » Where in the Wikipedia Is That Answer |
STOC
2002
ACM
14 years 9 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
WWW
2010
ACM
14 years 4 months ago
2010
ACM
We present Aardvark, a social search engine. With Aardvark, users ask a question, either by instant message, email, web input, text message, or voice. Aardvark then routes the que...
QSHINE
2009
IEEE
14 years 3 months ago
2009
IEEE
The deployment of sensor networks is both widespread and varied with more niche applications based on these networks. In the case study provided in this work, the network is provid...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...