934 search results - page 56 / 187 » Quantum Algorithmic Entropy |
SWAT
2000
Springer
14 years 12 days ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
We propose a new active learning algorithm to address the problem of selecting a limited subset of utterances for transcribing from a large amount of unlabeled utterances so that ...
COCO
2008
Springer
13 years 10 months ago
2008
Springer
r of Unentanglement (Extended Abstract) Scott Aaronson MIT Salman Beigi MIT Andrew Drucker MIT Bill Fefferman University of Chicago Peter Shor MIT The class QMA (k), introduced by...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
We give the first fully compressed representation of a set of m points on an n