11910 search results - page 437 / 2382 » Online Learning Algorithms |
150
click to vote
SWAT
2004
Springer
16 years 4 days ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
188
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
195
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
189
click to vote
SIROCCO
2001
15 years 8 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...