1337 search results - page 4 / 268 » Fast computation of distance estimators |
WSDM
2010
ACM
14 years 3 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
CVPR
2008
IEEE
14 years 7 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...
BMCBI
2006
13 years 5 months ago
2006
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
CGF
2004
13 years 5 months ago
2004
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...
ICMCS
2005
IEEE
13 years 11 months ago
2005
IEEE
The encoding process of image vector quantization (VQ) is very heavy due to it performing a lot of k-dimensional Euclidean distance computations. In order to speed up VQ encoding,...