2467 search results - page 208 / 494 » Finite State Machines |
186
click to vote
INTERSPEECH
2010
15 years 1 months ago
2010
This overview article reviews the structure of a fully statistical spoken dialogue system (SDS), using as illustration, various systems and components built at Cambridge over the ...
196
click to vote
JMLR
2012
13 years 9 months ago
2012
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
164
click to vote
ACSD
2007
IEEE
15 years 10 months ago
2007
IEEE
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
154
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on ...
186
click to vote
NIPS
2001
15 years 8 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...