3208 search results - page 179 / 642 » A Lower Bound for Primality |
147
click to vote
COCOON
2005
Springer
16 years 1 days 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...
153
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
174
click to vote
TDSC
2008
15 years 6 months ago
2008
The fundamental problem for inference control in data cubes is how to efficiently calculate the lower and upper bounds for each cell value given the aggregations of cell values ove...
178
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
We modify the multilevel successive elimination algorithm (MSEA) to make it compatible with the motion estimation required for the H.264/AVC video coding standard. The algorithm m...
168
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...