Sciweavers

SIGMOD
2005
ACM
113views Database» more  SIGMOD 2005»
13 years 10 months ago
Robust and Fast Similarity Search for Moving Object Trajectories
An important consideration in similarity-based retrieval of moving object trajectories is the definition of a distance function. The existing distance functions are usually sensi...
Lei Chen 0002, M. Tamer Özsu, Vincent Oria
FOCS
2005
IEEE
13 years 10 months ago
Nonembeddability theorems via Fourier analysis
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 ...
Subhash Khot, Assaf Naor
IDEAL
2007
Springer
13 years 11 months ago
A New Dissimilarity Measure Between Trees by Decomposition of Unit-Cost Edit Distance
Abstract. Tree edit distance is a conventional dissimilarity measure between labeled trees. However, tree edit distance including unit-cost edit distance contains the similarity of...
Hisashi Koga, Hiroaki Saito, Toshinori Watanabe, T...
GBRPR
2007
Springer
13 years 11 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
GBRPR
2007
Springer
13 years 11 months ago
A Quadratic Programming Approach to the Graph Edit Distance Problem
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
Michel Neuhaus, Horst Bunke
ECML
2007
Springer
13 years 11 months ago
Learning Balls of Strings with Correction Queries
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...
Leonor Becerra-Bonache, Colin de la Higuera, Jean-...
ICCBR
2009
Springer
13 years 11 months ago
Conceptual Neighborhoods for Retrieval in Case-Based Reasoning
Abstract. We present a case-based reasoning technique based on conceptual neighborhoods of cases. The system applies domain knowledge to the case retrieval process in the form of r...
Ben G. Weber, Michael Mateas
ICANNGA
2009
Springer
130views Algorithms» more  ICANNGA 2009»
13 years 11 months ago
String Distances and Uniformities
Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (...
David W. Pearson, Jean-Christophe Janodet
STACS
2009
Springer
13 years 11 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 5 months ago
Extending autocompletion to tolerate errors
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
Surajit Chaudhuri, Raghav Kaushik