Sciweavers

427 search results - page 16 / 86
» Computing the Local Consensus of Trees
Sort
View
109
Voted
TSP
2010
14 years 4 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
ESANN
2006
14 years 10 months ago
Unsupervised clustering of continuous trajectories of kinematic trees with SOM-SD
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
Jochen J. Steil, Risto Koiva, Alessandro Sperduti
DSOM
2005
Springer
15 years 3 months ago
Decentralized Computation of Threshold Crossing Alerts
Threshold crossing alerts (TCAs) indicate to a management system that a management variable, associated with the state, performance or health of the network, has crossed a certain ...
Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Cl...
68
Voted
ICIP
2006
IEEE
15 years 3 months ago
MRF Modeling for Optical Flow Computation from Multi-Structure Objects
We propose in this paper a new formulation of the equation of the optical flow enabling to compute global and local motions of multi-structure objects (flowers and petals, trees...
Véronique Prinet, Cyril Cassisa, FengFeng T...
WACV
2002
IEEE
15 years 2 months ago
Face Model Adaptation using Robust Matching and Active Appearance Models
This paper addresses the 3D tracking of pose and animation of the human face in monocular image sequences using deformable 3D models. For each frame, the proposed adaptation is sp...
Fadi Dornaika, Jörgen Ahlberg