116 search results - page 22 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
113
click to vote
ISMIR
2004
Springer
15 years 8 months ago
2004
Springer
Time series representations are common in MIR applications such as query-by-humming, where a sung query might be represented by a series of ‘notes’ for database retrieval. Whi...
136
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
118
Voted
SIGMOD
1999
ACM
15 years 7 months ago
1999
ACM
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
131
Voted
ALT
2006
Springer
16 years 11 days ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
132
Voted
Publication
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...