33 search results - page 5 / 7 » Compression of Strings with Approximate Repeats |
182
Voted
VLDB
2005
ACM
16 years 5 days ago
2005
ACM
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
198
Voted
MASCOTS
2010
15 years 8 months ago
2010
Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative beha...
177
click to vote
ACCV
2006
Springer
16 years 21 days ago
2006
Springer
Abstract. To develop statistical models for shapes, we utilize an elastic string representation where curves (denoting shapes) can bend and locally stretch (or compress) to optimal...
194
Voted
IFIPTCS
2000
15 years 10 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
187
Voted
CPM
2001
Springer
15 years 11 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...