26 search results - page 3 / 6 » Suffix Vector: A Space-Efficient Suffix Tree Representation |
118
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
102
click to vote
DL
2000
Springer
15 years 4 months ago
2000
Springer
In this paper we introduce the MatchDetectReveal(MDR) system, which is capable of identifying overlapping and plagiarised documents. Each component of the system is briefly descri...
90
Voted
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
83
Voted
TKDE
2008
15 years 5 days ago
2008
Phrase has been considered as a more informative feature term for improving the effectiveness of document clustering. In this paper, we propose a phrase-based document similarity t...
110
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
Models of activity structure for unconstrained environments are generally not available a priori. Recent representational approaches to this end are limited by their computational...