5221 search results - page 438 / 1045 » An On-line Problem Database |
181
click to vote
CINQ
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
203
click to vote
VLDB
2004
ACM
16 years 6 days ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
180
click to vote
CVPR
2010
IEEE
16 years 6 days ago
2010
IEEE
Real-world face recognition systems often have to face the single sample per person (SSPP) problem, that is, only a single training sample for each person is enrolled in the datab...
193
click to vote
DASFAA
2003
IEEE
16 years 5 days 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...
198
click to vote
ICDT
2003
ACM
16 years 2 days ago
2003
ACM
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...