Sciweavers

282 search results - page 51 / 57
» Approximation algorithms for facility location problems
Sort
View
SSD
2005
Springer
173views Database» more  SSD 2005»
14 years 27 days 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
CRV
2006
IEEE
69views Robotics» more  CRV 2006»
14 years 1 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
OPODIS
2004
13 years 8 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...
ICRA
2009
IEEE
231views Robotics» more  ICRA 2009»
14 years 2 months ago
Accurate 3D ground plane estimation from a single image
— Accurate localization of landmarks in the vicinity of a robot is a first step towards solving the SLAM problem. In this work, we propose algorithms to accurately estimate the ...
Anoop Cherian, Vassilios Morellas, Nikolaos Papani...
FGR
2004
IEEE
160views Biometrics» more  FGR 2004»
13 years 11 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