Sciweavers

3652 search results - page 377 / 731
» A study of query length
Sort
View
ECCC
2010
131views more  ECCC 2010»
15 years 4 months ago
High-rate codes with sublinear-time decoding
Locally decodable codes are error-correcting codes that admit efficient decoding algorithms; any bit of the original message can be recovered by looking at only a small number of ...
Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin
ECCC
2010
82views more  ECCC 2010»
15 years 4 months ago
A Strong Parallel Repetition Theorem for Projection Games on Expanders
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
Ran Raz
ENDM
2010
136views more  ENDM 2010»
15 years 4 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 4 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
IEICET
2008
57views more  IEICET 2008»
15 years 4 months ago
Impact of Well Edge Proximity Effect on Timing
This paper studies impact of the well edge proximity effect on digital circuit delay, based on model parameters extracted from test structures in an industrial 65nm wafer process. ...
Toshiki Kanamoto, Yasuhiro Ogasahara, Keiko Natsum...