9 search results - page 1 / 2 » Polylogarithmic Approximation for Edit Distance and the Asym... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
ECML
2007
Springer
13 years 11 months ago
2007
Springer
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
SSDBM
2003
IEEE
13 years 10 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...