11910 search results - page 182 / 2382 » Online Learning Algorithms |
115
click to vote
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
91
Voted
ICML
2000
IEEE
16 years 1 months ago
2000
IEEE
74
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
65
Voted
COLT
2008
Springer
15 years 2 months ago
2008
Springer