Sciweavers

909 search results - page 165 / 182
» Games for extracting randomness
Sort
View
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
16 years 4 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
16 years 1 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
IROS
2006
IEEE
162views Robotics» more  IROS 2006»
15 years 10 months ago
Efficiency Improvement in Monte Carlo Localization through Topological Information
- Monte Carlo localization is known to be one of the most reliable methods for pose estimation of a mobile robot. Many studies have been conducted to improve performance of MCL. Al...
Tae-Bum Kwon, Ju-Ho Yang, Jae-Bok Song, Woojin Chu...
CIKM
2008
Springer
15 years 6 months ago
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
Barbara Poblete, Carlos Castillo, Aristides Gionis
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
15 years 5 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe