Sciweavers

165 search results - page 4 / 33
» Parallel Algorithm for Computing Reversal Distance
Sort
View
IPPS
1999
IEEE
15 years 4 months ago
A Parallel Algorithm for Bound-Smoothing
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
Kumar Rajan, Narsingh Deo
IPPS
1997
IEEE
15 years 3 months ago
A Parallel Algorithm for Weighted Distance Transforms
This paper presents a parallel algorithm for the weighted distance transform and the nearest feature transform of an n 2 n binary image. We show that the algorithm runs in O(log n...
Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuza...
107
Voted
ICMCS
2008
IEEE
159views Multimedia» more  ICMCS 2008»
15 years 6 months ago
Using graphics devices in reverse: GPU-based Image Processing and Computer Vision
Graphics and vision are approximate inverses of each other: ordinarily Graphics Processing Units (GPUs) are used to convert “numbers into pictures” (i.e. computer graphics). I...
James Fung, Steve Mann
WIA
2000
Springer
15 years 3 months ago
Fast Implementations of Automata Computations
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
Anne Bergeron, Sylvie Hamel
TCS
2008
14 years 11 months ago
Multi-break rearrangements and chromosomal evolution
Most genome rearrangements (e.g., reversals and translocations) can be represented as 2-breaks that break a genome at 2 points and glue the resulting fragments in a new order. Mul...
Max A. Alekseyev, Pavel A. Pevzner