Sciweavers

2084 search results - page 83 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
STACS
2010
Springer
15 years 4 months ago
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
Edward A. Hirsch, Dmitry Itsykson
TIT
2010
136views Education» more  TIT 2010»
14 years 4 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
15 years 2 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
IAT
2009
IEEE
15 years 4 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
ICASSP
2011
IEEE
14 years 1 months ago
Exploiting an interplay between norms to analyze scalar quantization schemes
Quantization is intrinsic to several data acquisition systems. This process is especially important in distributed settings, where observations must rst be compressed before they ...
Parimal Parag, Jean-François Chamberland