Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

79

Voted

SODA
2008
ACM

favoriteEmaildiscussreport

75views Algorithms» more SODA 2008»

Approximating general metric distances between a pattern and a text

15 years 1 days ago

Approximating general metric distances between a pattern and a text

Download www.wisdom.weizmann.ac.il

Ely Porat, Klim Efremenko

Real-time Traffic

Algorithms | SODA 2008 |

claim paper

Related Content

» On Approximating the Average Distance Between Points

» Searching in metric spaces with userdefined and approximate distances

» Generalized pattern matching using orbit decomposition

» Approximate String Matching A Simpler Faster Algorithm

» Metric Learning for Text Documents

» Compact Location Problems

» Ordinal embeddings of minimum relaxation General properties trees and ultrametrics

» Clustering for metric and nonmetric distance measures

» Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	SODA
Authors	Ely Porat, Klim Efremenko

Comments (0)