Sciweavers

3356 search results - page 157 / 672
» Determining Consensus Numbers
Sort
View
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 10 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
DCC
2006
IEEE
14 years 9 months ago
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
Wilfried Meidl, Arne Winterhof
ALT
2009
Springer
14 years 7 months ago
Error-Correcting Tournaments
We present a family of adaptive pairwise tournaments that are provably robust against large error fractions when used to determine the largest element in a set. The tournaments use...
Alina Beygelzimer, John Langford, Pradeep Ravikuma...
ICC
2009
IEEE
135views Communications» more  ICC 2009»
14 years 4 months ago
Block Detection of Multiple Symbol DPSK in a Statistically Unknown Time-Varying Channel
—We present a detection scheme for multiple-symbol DPSK for use in a statistically unknown time-varying channel. The scheme relies on a parametric representation of the timevaryi...
Nathan Ricklin, James R. Zeidler
ALDT
2009
Springer
110views Algorithms» more  ALDT 2009»
14 years 4 months ago
Manipulating Tournaments in Cup and Round Robin Competitions
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the ...
Tyrel Russell, Toby Walsh