2252 search results - page 19 / 451 » Lower Bounds for Dynamic Algorithms |
118
Voted
WDAG
2009
Springer
15 years 9 months ago
2009
Springer
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
98
Voted
NIPS
2003
15 years 4 months ago
2003
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
148
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
93
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
142
Voted
NETWORKS
2008
15 years 2 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...