Sciweavers

495 search results - page 1 / 99
» A variant of the Ford-Johnson algorithm that is more space e...
Sort
View
IPL
2007
67views more  IPL 2007»
13 years 4 months ago
A variant of the Ford-Johnson algorithm that is more space efficient
Mauricio Ayala-Rincón, Bruno T. de Abreu, J...
ISVD
2007
IEEE
13 years 11 months ago
Variants of Jump Flooding Algorithm for Computing Discrete Voronoi Diagrams
Jump flooding algorithm (JFA) is an interesting way to utilize the graphics processing unit to efficiently compute Voronoi diagrams and distance transforms in 2D discrete space. T...
Guodong Rong, Tiow Seng Tan
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 5 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
3DIM
2001
IEEE
13 years 8 months ago
Efficient Variants of the ICP Algorithm
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variant...
Szymon Rusinkiewicz, Marc Levoy
STRINGOLOGY
2008
13 years 6 months ago
Efficient Variants of the Backward-Oracle-Matching Algorithm
In this article we present two efficient variants of the BOM string matching algorithm which are more efficient and flexible than the original algorithm. We also present bit-parall...
Simone Faro, Thierry Lecroq