Sciweavers

Share
7 search results - page 1 / 2
» approx 2011
Sort
View
APPROX
2011
Springer
254views Algorithms» more  APPROX 2011»
7 years 6 months ago
Black-Box Reductions in Mechanism Design
Zhiyi Huang, Lei Wang 0010, Yuan Zhou
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
7 years 6 months ago
On Approximating the Number of Relevant Variables in a Function
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
Dana Ron, Gilad Tsur
APPROX
2011
Springer
249views Algorithms» more  APPROX 2011»
7 years 6 months ago
A Canonical Form for Testing Boolean Function Properties
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
Dana Dachman-Soled, Rocco A. Servedio
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
7 years 6 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
7 years 6 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
books