2252 search results - page 116 / 451 » Lower Bounds for Dynamic Algorithms |
131
click to vote
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...
132
click to vote
DATAMINE
2006
15 years 3 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
148
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
141
click to vote
JCO
2008
15 years 3 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
115
click to vote
INFOCOM
1999
IEEE
15 years 7 months ago
1999
IEEE
In an integrated services network, resources are shared by multiple traffic classes. Service classes that deliver guaranteed Quality-ofService (QoS) to applications have priority ...