4541 search results - page 523 / 909 » Cache-Oblivious Algorithms and Data Structures |
179
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— 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 ...
182
Voted
DEXA
2005
Springer
16 years 13 days ago
2005
Springer
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...
223
Voted
VISUALIZATION
2002
IEEE
15 years 11 months ago
2002
IEEE
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...
160
click to vote
JPDC
2008
15 years 6 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
174
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
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...