367 search results - page 3 / 74 » Tight lower bounds for the online labeling problem |
STOC
2003
ACM
14 years 6 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device with several input po...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
Publication
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
SODA
2010
ACM
13 years 4 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...