2392 search results - page 49 / 479 » Matching data dissemination algorithms to application requir... |
306
click to vote
VLDB
2002
ACM
16 years 6 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
169
click to vote
FCCM
2009
IEEE
15 years 10 months ago
2009
IEEE
FPGA has long been considered an attractive platform for high performance implementations of string matching. However, as the size of pattern dictionaries continues to grow, such ...
161
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
151
click to vote
BMVC
2000
15 years 7 months ago
2000
Vision-based systems for remote surveillance usually involve change detection algorithms for intruders, obstacles or irregularities detection. In particular, there is a potentiall...
168
click to vote
ICMLA
2008
15 years 7 months ago
2008
Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. Thi...