Sciweavers

1140 search results - page 23 / 228
» Sports over a distance
Sort
View
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
14 years 11 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen
ICPR
2008
IEEE
16 years 1 months ago
Circular Earth Mover's Distance for the comparison of local features
Many computer vision algorithms make use of local features, and rely on a systematic comparison of these features. The chosen dissimilarity measure is of crucial importance for th...
Julie Delon, Julien Rabin, Yann Gousseau
110
Voted
JGT
2008
91views more  JGT 2008»
15 years 21 days ago
On the editing distance of graphs
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...
Maria Axenovich, André E. Kézdy, Rya...
85
Voted
WACV
2002
IEEE
15 years 5 months ago
Using attribute trees to analyse auroral appearance over Canada
Modern space research uses both satellite-born and ground-based instruments to measure the near-Earth space environment. Studying the auroral display provides information of the e...
Mikko T. Syrjäsuo, Eric F. Donovan, Markus Pe...
95
Voted
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 24 days ago
Coding over an Erasure Channel with a Large Alphabet Size
An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes...
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...