Sciweavers

167 search results - page 13 / 34
» Constraints for closest point finding
Sort
View
HOTOS
2007
IEEE
13 years 11 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
ICB
2009
Springer
355views Biometrics» more  ICB 2009»
14 years 2 months ago
3D Signatures for Fast 3D Face Recognition
We propose a vector representation (called a 3D signature) for 3D face shape in biometrics applications. Elements of the vector correspond to fixed surface points in a face-centere...
Chris Boehnen, Tanya Peters, Patrick J. Flynn
IPSN
2005
Springer
14 years 1 months ago
Towards optimal sleep scheduling in sensor networks for rare-event detection
— Lifetime maximization is one key element in the design of sensor-network-based surveillance applications. We propose a protocol for node sleep scheduling that guarantees a boun...
Qing Cao, Tarek F. Abdelzaher, Tian He, John A. St...
IJRR
2007
80views more  IJRR 2007»
13 years 7 months ago
Combined Path-following and Obstacle Avoidance Control of a Wheeled Robot
This paper proposes an algorithm that drives a unicycle type robot to a desired path, including obstacle avoidance capabilities. The path-following control design relies on Lyapun...
Lionel Lapierre, René Zapata, Pascal L&eacu...
ECCC
2006
145views more  ECCC 2006»
13 years 8 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder