3208 search results - page 211 / 642 » A Lower Bound for Primality |
161
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...
177
click to vote
ICIAP
2007
ACM
16 years 6 months ago
2007
ACM
This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation....
171
click to vote
COMPGEOM
2004
ACM
16 years 3 hour ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
173
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
181
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...