Sciweavers

1082 search results - page 96 / 217
» Approximation Algorithms for Spreading Points
Sort
View
COMPGEOM
1996
ACM
14 years 1 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor
CVPR
2012
IEEE
11 years 11 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
VLDB
2009
ACM
159views Database» more  VLDB 2009»
14 years 9 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
IPPS
2006
IEEE
14 years 3 months ago
On the performance of parallel normalized explicit preconditioned conjugate gradient type methods
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...
George A. Gravvanis, Konstantinos M. Giannoutakis
3DPVT
2004
IEEE
148views Visualization» more  3DPVT 2004»
14 years 23 days ago
Surface Model Generation from Range Images of Industrial Environments
This paper presents an hybrid segmentation technique that combines both the speed of an edge based approach with the robustness of a surface based approach. It consists of three s...
Angel Domingo Sappa