10 search results - page 2 / 2 » An Improvement and an Extension on the Hybrid Index for Appr... |
DASFAA
2003
IEEE
13 years 11 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
SPIRE
2005
Springer
13 years 11 months ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
PAMI
2012
11 years 8 months ago
2012
—SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition...
CSDA
2008
13 years 5 months ago
2008
Non-negative Matrix Factorization (NMF) and Probabilistic Latent Semantic Indexing (PLSI) have been successfully applied to document clustering recently. In this paper, we show th...