Sciweavers

4973 search results - page 951 / 995
» Probabilistic Algorithms in Robotics
Sort
View
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 7 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 7 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
KDD
2010
ACM
253views Data Mining» more  KDD 2010»
15 years 6 months ago
Mining periodic behaviors for moving objects
Periodicity is a frequently happening phenomenon for moving objects. Finding periodic behaviors is essential to understanding object movements. However, periodic behaviors could b...
Zhenhui Li, Bolin Ding, Jiawei Han, Roland Kays, P...
SIGIR
2010
ACM
15 years 6 months ago
Positional relevance model for pseudo-relevance feedback
Pseudo-relevance feedback is an effective technique for improving retrieval results. Traditional feedback algorithms use a whole feedback document as a unit to extract words for ...
Yuanhua Lv, ChengXiang Zhai
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
15 years 6 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir