Sciweavers

178 search results - page 27 / 36
» Fast Algorithms for Top-k Approximate String Matching
Sort
View
ICCV
2011
IEEE
13 years 9 months ago
A Graph-matching Kernel for Object Categorization
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
Olivier Duchenne, Armand Joulin, Jean Ponce
EDBT
2004
ACM
121views Database» more  EDBT 2004»
15 years 9 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
KYOTODL
2000
140views more  KYOTODL 2000»
14 years 10 months ago
Text Data Mining: Discovery of Important Keywords in the Cyberspace
This paper describes applications of the optimized pattern discover),framework to text and Webmining. In particular; we introduce a class of simple combinatorialpatterns over phra...
Hiroki Arimura, Jun-ichiro Abe, Hiroshi Sakamoto, ...
173
Voted
VLDB
2003
ACM
147views Database» more  VLDB 2003»
15 years 9 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
SAC
2005
ACM
15 years 3 months ago
Performance evaluation for text processing of noisy inputs
We investigate the problem of evaluating the performance of text processing algorithms on inputs that contain errors as a result of optical character recognition. A new hierarchic...
Daniel P. Lopresti