1879 search results - page 111 / 376 » Computational geometry algorithms library |
163
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
130
click to vote
ACL
2010
15 years 2 months ago
2010
We present the S-Space Package, an open source framework for developing and evaluating word space algorithms. The package implements well-known word space algorithms, such as LSA,...
152
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
We propose a new approach called "appearance clustering" for scene analysis. The key idea in this approach is that the scene points can be clustered according to their s...
218
click to vote
CAD
2011
Springer
14 years 11 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
120
click to vote
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
A multi-cluster computational environment with mixed-mode (MPI + OpenMP) parallelism for estimation of unknown regional electrical conductivities of the human head, based on realis...