367 search results - page 55 / 74 » Tight lower bounds for the online labeling problem |
DAWAK
2011
Springer
12 years 7 months ago
2011
Springer
(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to ...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...