6365 search results - page 214 / 1273 » Fast Local Computation Algorithms |
167
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to...
214
Voted
VLSM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
204
click to vote
ADHOCNOW
2010
Springer
15 years 7 months ago
2010
Springer
Random walks in wireless sensor networks can serve as fully local, very simple strategies for sink motion that reduce energy dissipation a lot but increase the latency of data coll...
173
click to vote
SIAMSC
2008
15 years 6 months ago
2008
In this paper we propose a novel computational technique to solve the Eikonal equation. The proposed method manages the list of active nodes and iteratively updates the solutions ...
178
click to vote
CGF
2007
15 years 6 months ago
2007
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...