376 search results - page 22 / 76 » On the Advice Complexity of Online Problems |
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
112
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart perform...
100
click to vote
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
100
click to vote
AAAI
2010
15 years 1 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...