71228 search results - page 239 / 14246 » Algorithms |
105
Voted
DAC
2003
ACM
16 years 2 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
114
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
128
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
AdaBoost.OC has shown to be an effective method in boosting "weak" binary classifiers for multi-class learning. It employs the Error Correcting Output Code (ECOC) method...
117
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
115
click to vote
SAC
2010
ACM
15 years 8 months ago
2010
ACM
This paper presents the Referrer Graph (RG) web prediction algorithm as a low-cost solution to predict next web user accesses. RG is aimed at being used in a real web system with ...