Sciweavers

274 search results - page 14 / 55
» Approximating Edit Distance Efficiently
Sort
View
TASLP
2010
122views more  TASLP 2010»
13 years 4 months ago
Error Approximation and Minimum Phone Error Acoustic Model Estimation
Minimum phone error (MPE) acoustic parameter estimation involves calculation of edit distances (errors) between correct and incorrect hypotheses. In the context of large vocabulary...
Matt Gibson 0002, Thomas Hain
CVPR
2004
IEEE
14 years 12 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
13 years 9 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
ADC
2008
Springer
141views Database» more  ADC 2008»
14 years 4 months ago
Approximate Retrieval of XML Data with ApproXPath
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
Lin Xu, Curtis E. Dyreson
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 11 months ago
Efficient Query Processing in Large Traffic Networks
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...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...