Sciweavers

265 search results - page 9 / 53
» On varieties of meet automata
Sort
View
ICGI
1998
Springer
13 years 11 months ago
Learning Stochastic Finite Automata from Experts
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...
Colin de la Higuera
JUCS
2002
179views more  JUCS 2002»
13 years 7 months ago
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
Bruce W. Watson
FSMNLP
2008
Springer
13 years 9 months ago
Learning with Weighted Transducers
Weighted finite-state transducers have been used successfully in a variety of natural language processing applications, including speech recognition, speech synthesis, and machine ...
Corinna Cortes, Mehryar Mohri
RIAO
2000
13 years 8 months ago
Multimodal Meeting Tracker
Face-to-face meetings usually encompass several modalities including speech, gesture, handwriting, and person identification. Recognition and integration of each of these modaliti...
Michael Bett, Ralph Gross, Hua Yu, Xiaojin Zhu, Yu...
CHI
2010
ACM
14 years 17 days ago
The NICE discussion room: integrating paper and digital media to support co-located group meetings
Current technological solutions that enable content creation and sharing during group discussion meetings are often cumbersome to use, and are commonly abandoned for traditional p...
Michael Haller, Jakob Leitner, Thomas Seifried, Ja...