324 search results - page 10 / 65 » Distance Approximating Trees: Complexity and Algorithms |
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
TCOM
2010
13 years 2 months ago
2010
The class of variable-length finite-state joint source-channel codes is defined and a polynomial complexity algorithm for the evaluation of their distance spectrum presented. Issu...
CPM
2000
Springer
13 years 11 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Todays abundance of storage coupled with digital technologies in virtually any scientific or commercial application such as medical and biological imaging or music archives deal w...