1100 search results - page 48 / 220 » Approximate distance oracles |
CCCG
2006
14 years 11 months ago
2006
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
TCOM
2010
14 years 4 months ago
2010
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...
186
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
BIOINFORMATICS
2011
14 years 5 months ago
2011
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both ...
SAC
2009
ACM
15 years 4 months ago
2009
ACM
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...