1972 search results - page 111 / 395 » Hidden semi-Markov models |
161
click to vote
ICML
1997
IEEE
16 years 7 months ago
1997
IEEE
In recent years there has been a flurry of works on learning probabilistic belief networks. Current state of the art methods have been shown to be successful for two learning scen...
160
click to vote
COLT
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper investigates the decentralized detection of Hidden Markov Processes using the NeymanPearson test. We consider a network formed by a large number of distributed sensors....
146
click to vote
ER
2007
Springer
16 years 17 days ago
2007
Springer
The longstanding problem of automatic table interpretation still illudes us. Its solution would not only be an aid to table processing applications such as large volume table conve...
174
click to vote
ECCV
2000
Springer
16 years 8 months ago
2000
Springer
A new probabilistic background model based on a Hidden Markov Model is presented. The hidden states of the model enable discrimination between foreground, background and shadow. Th...