Sciweavers

2050 search results - page 177 / 410
» Shapes as empirical distributions
Sort
View
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
CONNECTION
2007
87views more  CONNECTION 2007»
15 years 6 months ago
Efficient architectures for sparsely-connected high capacity associative memory models
In physical implementations of associative memory, wiring costs play a significant role in shaping patterns of connectivity. In this study of sparsely-connected associative memory...
Lee Calcraft, Rod Adams, Neil Davey
WEBI
2004
Springer
15 years 12 months ago
Mining Local Data Sources For Learning Global Cluster Models
— Distributed data mining has recently caught a lot of attention as there are many cases where pooling distributed data for mining is probibited, due to either huge data volume o...
Chak-Man Lam, Xiaofeng Zhang, William Kwok-Wai Che...
AIMSA
2008
Springer
15 years 8 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz
NIPS
2008
15 years 8 months ago
Domain Adaptation with Multiple Sources
This paper presents a theoretical analysis of the problem of domain adaptation with multiple sources. For each source domain, the distribution over the input points as well as a h...
Yishay Mansour, Mehryar Mohri, Afshin Rostamizadeh