361 search results - page 53 / 73 » Problem Frames: A Case for Coordination |
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— Consider a coverage problem for a team of agents in the plane: target points appear sporadically over time in a bounded environment and must be visited by one of the agents. It...
ESA
2003
Springer
14 years 19 days ago
2003
Springer
We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...
VLC
2008
13 years 7 months ago
2008
Recognizing hand-sketched symbols is a definitely complex problem. The input drawings are often intrinsically ambiguous, and require context to be interpreted in a correct way. Ma...
IJCV
1998
13 years 7 months ago
1998
The structure-from-motion problem has been extensively studied in the field of computer vision. Yet, the bulk of the existing work assumes that the scene contains only a single mo...
SIAMCOMP
2010
13 years 2 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...