Sciweavers

157 search results - page 29 / 32
» Randomized Algorithms for Minimum Distance Localization
Sort
View
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 6 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
HICSS
2010
IEEE
193views Biometrics» more  HICSS 2010»
14 years 1 months ago
The Topological and Electrical Structure of Power Grids
Numerous recent papers have found important relationships between network structure and risks within networks. These results indicate that network structure can dramatically affec...
Paul Hines, Seth Blumsack, E. Cotilla Sanchez, C. ...
JSAC
2007
139views more  JSAC 2007»
13 years 6 months ago
Reverse-Engineering MAC: A Non-Cooperative Game Model
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
Jang-Won Lee, Ao Tang, Jianwei Huang, Mung Chiang,...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 6 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 4 months ago
Is submodularity testable?
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
C. Seshadhri, Jan Vondrák