3825 search results - page 211 / 765 » More on pooling spaces |
137
click to vote
DCG
2010
15 years 6 months ago
2010
Abstract. The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. Th...
190
click to vote
JACM
2006
15 years 6 months ago
2006
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
188
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
155
click to vote
ROBOTICA
2008
15 years 6 months ago
2008
Polyhedral scene analysis studies whether a 2D line drawing of a 3D polyhedron is realizable in the space, and if so, parameterizing the space of all possible realizations. For gen...
161
click to vote
EMNLP
2010
15 years 4 months ago
2010
Syntax-based translation models should in principle be efficient with polynomially-sized search space, but in practice they are often embarassingly slow, partly due to the cost of...