83 search results - page 17 / 17 » Effective Component Tree Computation with Application to Pat... |
CVPR
2006
IEEE
14 years 7 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
APGV
2004
ACM
13 years 10 months ago
2004
ACM
Motivated by the need for an informative, unbiased and quantitative perceptual method for the development and evaluation of a talking head we are developing, we propose a new test...
KDD
2005
ACM
14 years 5 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...