206 search results - page 7 / 42 » Probabilistic Analysis of Large Finite State Machines |
102
click to vote
ICDAR
2007
IEEE
15 years 6 months ago
2007
IEEE
With the increasing market of cheap cameras, natural scene text has to be handled in an efficient way. Some works deal with text detection in the image while more recent ones poi...
113
click to vote
ACL
1997
15 years 1 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
93
Voted
BC
2008
14 years 11 months ago
2008
In this paper we introduce a simple model based on probabilistic finite state automata to describe an emotional interaction between a robot and a human user, or between simulated a...
115
click to vote
FASE
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
80
Voted
SPIRE
2001
Springer
15 years 4 months ago
2001
Springer
Thispaper describes speed-up of string pattern matchingby rearrangingstates inAho-Corasickpattern matching machine, which is a kind of afinite automaton. Werealized speed-up of st...