14386 search results - page 2426 / 2878 » The Chinese Generals Problem |
188
Voted
KDD
2004
ACM
16 years 7 months ago
2004
ACM
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
182
Voted
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
218
Voted
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Combining multiple classifiers is of particular interest in multimedia applications. Each modality in multimedia data can be analyzed individually, and combining multiple pieces of...
167
Voted
KDD
2002
ACM
16 years 7 months ago
2002
ACM
We propose mixtures of hidden Markov models for modelling clickstreams of web surfers. Hence, the page categorization is learned from the data without the need for a (possibly cumb...
208
Voted
KDD
2001
ACM
16 years 7 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...