1688 search results - page 225 / 338 » The Complexity of Rationalizing Matchings |
176
click to vote
FOCS
2006
IEEE
16 years 14 days ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
106
click to vote
IPPS
2006
IEEE
16 years 13 days ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
177
click to vote
CVPR
2005
IEEE
16 years 20 hour ago
2005
IEEE
This work achieves an efficient acquisition of scenes and their depths along streets. During the movement of a vehicle, a slit in the camera frame is set properly to sample scenes...
159
click to vote
ICRA
2005
IEEE
16 years 1 hour ago
2005
IEEE
— In this paper we address tasks for multirobot teams that require solving a distributed multi-agent planning problem in which the actions of robots are tightly coupled. The unce...
183
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...