Sciweavers

71 search results - page 11 / 15
» Coxeter Lattice Paths
Sort
View
ICCAD
1996
IEEE
86views Hardware» more  ICCAD 1996»
15 years 1 months ago
Tearing based automatic abstraction for CTL model checking
Based Automatic Abstraction for CTL Model Checking Woohyuk Lee Abelardo Pardo Jae-Young Jang Gary Hachtel Fabio Somenzi University of Colorado ECEN Campus Box 425 Boulder, CO, 8030...
Woohyuk Lee, Abelardo Pardo, Jae-Young Jang, Gary ...
CSL
2002
Springer
14 years 9 months ago
Weighted finite-state transducers in speech recognition
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
Mehryar Mohri, Fernando Pereira, Michael Riley
73
Voted
BIRTHDAY
2009
Springer
15 years 4 months ago
Polynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
Thomas Gawlitza, Jérôme Leroux, Jan R...
ICASSP
2009
IEEE
15 years 4 months ago
Improving multi-lattice alignment based spoken keyword spotting
In previous work, we showed that using a lattice instead of the 1-best path to represent both the query and the utterance being searched is beneficial for spoken keyword spotting...
Hui Lin, Alex Stupakov, Jeff Bilmes
SIGECOM
2003
ACM
124views ECommerce» more  SIGECOM 2003»
15 years 2 months ago
Coalitional games on graphs: core structure, substitutes and frugality
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma