817 search results - page 118 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
PR
2008
13 years 7 months ago
2008
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
ALT
2007
Springer
14 years 1 months ago
2007
Springer
This paper deals with the problem of making predictions in the online mode of learning where the dependence of the outcome yt on the signal xt can change with time. The Aggregating...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
PODS
2001
ACM
14 years 7 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...