Sciweavers

654 search results - page 80 / 131
» On the Approximation of Computing Evolutionary Trees
Sort
View
TIP
2008
195views more  TIP 2008»
14 years 9 months ago
Image Coding Using Dual-Tree Discrete Wavelet Transform
In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. Three methods for sp...
Jingyu Yang, Yao Wang, Wenli Xu, Qionghai Dai
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
15 years 10 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
ICALP
2005
Springer
15 years 3 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
SODA
2003
ACM
142views Algorithms» more  SODA 2003»
14 years 11 months ago
The similarity metric
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vit&...
3DIM
2007
IEEE
15 years 4 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...