316 search results - page 57 / 64 » Approximation algorithms for hierarchical location problems |
127
click to vote
CRV
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper considers the problem of shape-from-shading using nearby planar distributed illuminants. It is shown that a rectangular planar nearby distributed uniform isotropic illu...
124
Voted
SSD
2005
Springer
15 years 9 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
129
Voted
FGR
2004
IEEE
15 years 7 months ago
2004
IEEE
We consider the problem of robustly and accurately locating facial features. The relative positions of different feature points are represented using a statistical shape model. We...
131
Voted
OPODIS
2004
15 years 5 months ago
2004
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
161
Voted
ICDCN
2009
Springer
15 years 10 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...