Sciweavers

4536 search results - page 545 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
16 years 7 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
ICRA
2009
IEEE
150views Robotics» more  ICRA 2009»
16 years 1 months ago
Flow separation for fast and robust stereo odometry
— Separating sparse flow provides fast and robust stereo visual odometry that deals with nearly degenerate situations that often arise in practical applications. We make use of ...
Michael Kaess, Kai Ni, Frank Dellaert
DEXA
2005
Springer
160views Database» more  DEXA 2005»
16 years 10 days ago
Improved Sequential Pattern Mining Using an Extended Bitmap Representation
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
Chien-Liang Wu, Jia-Ling Koh, Pao-Ying An
VISUALIZATION
2002
IEEE
15 years 11 months ago
BLIC: Bi-Level Isosurface Compression
In this paper we introduce a new and simple algorithm to compress isosurface data. This is the data extracted by isosurface algorithms from scalar functions defined on volume gri...
Gabriel Taubin
CIKM
2009
Springer
15 years 11 months ago
Density-based clustering using graphics processors
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
Christian Böhm, Robert Noll, Claudia Plant, B...