Sciweavers

2570 search results - page 93 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
JMIV
2002
126views more  JMIV 2002»
14 years 9 months ago
Tree-Structured Haar Transforms
In our recent work, a class of parametric transforms, including family of Haar-like transforms, was introduced and studied in application to image compression. Parametric Haar-lik...
Karen O. Egiazarian, Jaakko Astola
GD
2001
Springer
15 years 2 months ago
Fast and Simple Horizontal Coordinate Assignment
Abstract. We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to ...
Ulrik Brandes, Boris Köpf
SIAMIS
2008
279views more  SIAMIS 2008»
14 years 10 months ago
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...
Yilun Wang, Junfeng Yang, Wotao Yin, Yin Zhang
SPAA
1998
ACM
15 years 2 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
15 years 3 months ago
Parallel FFT computation with a CDMA-based network-on-chip
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
Daewook Kim, Manho Kim, Gerald E. Sobelman