Sciweavers

273 search results - page 40 / 55
» Compressed String Dictionaries
Sort
View
TIP
2010
255views more  TIP 2010»
13 years 2 months ago
Image Super-Resolution Via Sparse Representation
This paper presents a new approach to single-image superresolution, based on sparse signal representation. Research on image statistics suggests that image patches can be wellrepre...
Jianchao Yang, John Wright, Thomas S. Huang, Yi Ma
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 1 months ago
Indexing Mixed Types for Approximate Retrieval
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...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...
CPM
2001
Springer
211views Combinatorics» more  CPM 2001»
14 years 6 days ago
Fuzzy Hamming Distance: A New Dissimilarity Measure
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
Abraham Bookstein, Shmuel T. Klein, Timo Raita
ICMCS
2006
IEEE
122views Multimedia» more  ICMCS 2006»
14 years 1 months ago
A Robust Entropy-Based Audio-Fingerprint
Audio Fingerprints (AFP’s) are compact, content-based representations of audio signals used to measure distances among them. An AFP has to be small, fast computed and robust to ...
Antonio Camarena-Ibarrola, Edgar Chávez
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
13 years 12 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...