116 search results - page 22 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
ISMIR
2004
Springer
14 years 1 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...
WWW
2008
ACM
14 years 9 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...
SIGMOD
1999
ACM
14 years 26 days 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...
ALT
2006
Springer
14 years 5 months 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...
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...