3088 search results - page 262 / 618 » Online Passive-Aggressive Algorithms |
180
click to vote
NIPS
2000
15 years 8 months ago
2000
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...
187
Voted
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
144
click to vote
SPAA
1990
ACM
15 years 10 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
182
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
143
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Recently, Haas and Hellerstein proposed the hash ripple join algorithm in the context of online aggregation. Although the algorithm rapidly gives a good estimate for many join-agg...