Sciweavers

1119 search results - page 1 / 224
» Hypercube Algorithms for Image Transformations
Sort
View
ICPP
1989
IEEE
13 years 8 months ago
Hypercube Algorithms for Image Transformations
Efficient hypercube algorithms are developed for the following image transformations: shrinking, expanding, translation, rotation, and scaling. A 2k −step shrinking and expandi...
Sanjay Ranka, Sartaj Sahni
IPPS
1997
IEEE
13 years 8 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...
JSA
2000
116views more  JSA 2000»
13 years 4 months ago
A fault tolerant routing algorithm based on cube algebra for hypercube systems
We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a nonfaulty hypercube. The number of faulty nodes and links may b...
Novruz M. Allahverdi, Sirzad S. Kahramanli, Kayhan...
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 4 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle