2073 search results - page 268 / 415 » Learning for Dynamic Subsumption |
NIPS
2001
14 years 11 months ago
2001
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integ...
WIIW
2001
14 years 11 months ago
2001
Automating semantic matching of attributes for the purpose of information integration is challenging, and the dynamics of the Web further exacerbate this problem. Believing that m...
85
Voted
ALGORITHMICA
2010
14 years 10 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
IJON
2006
14 years 10 months ago
2006
The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are conn...
PAMI
2006
14 years 10 months ago
2006
This paper sets out a tracking framework, which is applied to the recovery of threedimensional hand motion from an image sequence. The method handles the issues of initialization,...