Sciweavers

240 search results - page 1 / 48
» Efficient Variants of the Backward-Oracle-Matching Algorithm
Sort
View
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
ISVD
2007
IEEE
13 years 10 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
PAMI
2010
112views more  PAMI 2010»
13 years 2 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
ISCC
2009
IEEE
149views Communications» more  ISCC 2009»
13 years 11 months ago
A secure variant of the Hill Cipher
The Hill cipher is a classical symmetric encryption algorithm that succumbs to the know-plaintext attack. Although its vulnerability to cryptanalysis has rendered it unusable in p...
Mohsen Toorani, Abolfazl Falahati
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