1622 search results - page 4 / 325 » Learning a Hidden Matching |
KBSE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
105
click to vote
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
87
Voted
SSPR
2004
Springer
15 years 2 months ago
2004
Springer
The creation of a cognitive perception systems capable of inferring higher-level semantic information from low-level feature and event information for a given type of multimedia co...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
UAI
2001
14 years 11 months ago
2001
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Dete...