Sciweavers

933 search results - page 91 / 187
» Fully automatic cross-associations
Sort
View
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 6 months ago
Well-definedness of Streams by Transformation and Termination
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...
Hans Zantema
184
Voted
IJAOSE
2008
120views more  IJAOSE 2008»
15 years 6 months ago
An architecture for exception management in multiagent systems
: Multiagent Systems (MAS) are open, heterogeneous and distributed software systems of autonomous agents. The management of exception differs in MAS from what is known in usual eng...
Eric Platon, Nicolas Sabouret, Shinichi Honiden
JMM2
2006
141views more  JMM2 2006»
15 years 6 months ago
Optimal Weighting of Landmarks for Face Recognition
A new method named Landmark Model Matching was recently proposed for fully automatic face recognition. It was inspired by Elastic Bunch Graph Matching and Active Shape Model. Landm...
Rajinda Senaratne, Saman K. Halgamuge
IJSM
2007
103views more  IJSM 2007»
15 years 6 months ago
Posture Invariant Correspondence of Incomplete Triangular Manifolds
We present an approach to find dense point-to-point correspondences between two deformed surfaces corresponding to different postures of the same nonrigid object in a fully autom...
Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Zouhou...
ISCI
2007
181views more  ISCI 2007»
15 years 6 months ago
AdROSA - Adaptive personalization of web advertising
One of the greatest and most recent challenges for online advertising is the use of adaptive personalization at the same time that the Internet continues to grow as a global market...
Przemyslaw Kazienko, Michal Adamski