312 search results - page 36 / 63 » Iterative compression and exact algorithms |
IROS
2009
IEEE
14 years 4 months ago
2009
IEEE
— A new method for fast visual grasp of unknown objects using a camera mounted on a robot in an eye-inhand configuration is presented. The method is composed of a fast iterative...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
SIAMIS
2010
13 years 4 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
CIAC
2006
Springer
14 years 1 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
FUIN
2010
13 years 7 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...