Sciweavers

354 search results - page 3 / 71
» Approximate String Joins
Sort
View
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
14 years 29 days ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
MFCS
2005
Springer
14 years 1 months ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
Petr Kolman
SSDBM
2008
IEEE
111views Database» more  SSDBM 2008»
14 years 2 months ago
iJoin: Importance-Aware Join Approximation over Data Streams
We consider approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available space, precluding exact processing. Selective evi...
Dhananjay Kulkarni, Chinya V. Ravishankar
DASFAA
2007
IEEE
178views Database» more  DASFAA 2007»
14 years 1 months ago
Efficient Semantically Equal Join on Strings
Juggapong Natwichai, Xingzhi Sun, Maria E. Orlowsk...