Sciweavers

2553 search results - page 278 / 511
» Modeling Trees with Hypertextures
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Fast Multiple Shape Correspondence by Pre-Organizing Shape Instances
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In general, shapecorrespondenc...
Andrew Temlyakov, Brent C. Munsell, Song Wang
CVPR
2007
IEEE
16 years 8 months ago
Learning Visual Similarity Measures for Comparing Never Seen Objects
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
Eric Nowak, Frédéric Jurie
ICML
2006
IEEE
16 years 7 months ago
Full Bayesian network classifiers
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
Jiang Su, Harry Zhang
PODS
2009
ACM
122views Database» more  PODS 2009»
16 years 7 months ago
Satisfiability of downward XPath with data equality tests
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
Diego Figueira
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 7 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...