2310 search results - page 55 / 462 » The selection efficiency of tournaments |
ISAAC
1994
Springer
13 years 11 months ago
1994
Springer
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
ESANN
2008
13 years 9 months ago
2008
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
IJON
2006
13 years 7 months ago
2006
In this letter, a two-step learning scheme for the optimal selection of time lags is proposed for a typical temporal blind source separation (TBSS), Temporal Decorrelation source ...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
One major problem of existing methods to mine data streams is that it makes ad hoc choices to combine most recent data with some amount of old data to search the new hypothesis. T...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...