79 search results - page 9 / 16 » The Last Fraction of a Fractional Conjecture |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
We propose a method that detects the true direction of time series, by fitting an autoregressive moving average model to the data. Whenever the noise is independent of the previou...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Say that f : {0, 1}n → {0, 1} -approximates g : {0, 1}n → {0, 1} if the functions disagree on at most an fraction of points. This paper contains two results about approximatio...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...