1314 search results - page 193 / 263 » Approximate data mining in very large relational data |
134
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
145
click to vote
ICCS
2003
Springer
15 years 9 months ago
2003
Springer
Memory traces record the addresses touched by a program during its execution, enabling many useful investigations for understanding and predicting program performance. But complete...
117
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
126
click to vote
ICA
2004
Springer
15 years 9 months ago
2004
Springer
We treat the problem of Blind Deconvolution of Single Input - Single Output (SISO) systems with real or complex binary sources. We explicate the basic mathematical idea by focusing...
125
click to vote
ISMIR
2004
Springer
15 years 9 months ago
2004
Springer
We took a collection of 100 drum beats from popular music tracks and estimated the measure length and downbeat position of each one. Using these values, we normalized each pattern...