Sciweavers

316 search results - page 57 / 64
» Approximation algorithms for hierarchical location problems
Sort
View
CRV
2006
IEEE
69views Robotics» more  CRV 2006»
15 years 3 months ago
Photometric Stereo with Nearby Planar Distributed Illuminants
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...
James J. Clark
SSD
2005
Springer
173views Database» more  SSD 2005»
15 years 3 months ago
On Discovering Moving Clusters in Spatio-temporal Data
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...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras
FGR
2004
IEEE
160views Biometrics» more  FGR 2004»
15 years 1 months ago
A Comparison of Shape Constrained Facial Feature Detectors
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...
David Cristinacce, Timothy F. Cootes
OPODIS
2004
14 years 11 months ago
Searching for a Black Hole in Tree Networks
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...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
ICDCN
2009
Springer
15 years 4 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
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, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...