431 search results - page 40 / 87 » Representation Changes for Efficient Learning in Structural ... |
113
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
100
click to vote
JMLR
2002
15 years 4 days ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
124
click to vote
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Visual tracking is a challenging problem, as an object may change its appearance due to pose variations, illumination changes, and occlusions. Many algorithms have been proposed t...
119
Voted
ML
2006
ACM
15 years 13 days ago
2006
ACM
We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and...
186
Voted
IJCV
2007
15 years 12 days ago
2007
Abstract. Inspired by the early visual system of many mammalians we consider the construction of-and reconstruction from- an orientation score Uf : R2 ×S1 → C as a local orienta...