Sciweavers

310 search results - page 29 / 62
» An error bound for model reduction of Lur'e-type systems
Sort
View
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
14 years 3 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...
ACL
2007
13 years 10 months ago
Randomised Language Modelling for Statistical Machine Translation
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
David Talbot, Miles Osborne
ICDAR
2011
IEEE
12 years 8 months ago
OCR-Driven Writer Identification and Adaptation in an HMM Handwriting Recognition System
—We present an OCR-driven writer identification algorithm in this paper. Our algorithm learns writer-specific characteristics more precisely from explicit character alignment usi...
Huaigu Cao, Rohit Prasad, Prem Natarajan
ICASSP
2008
IEEE
14 years 2 months ago
System combination using auxiliary information for speaker verification
Recent studies in speaker recognition have shown that scorelevel combination of subsystems can yield significant performance gains over individual subsystems. We explore the use ...
Luciana Ferrer, Martin Graciarena, Argyrios Zymnis...
TASLP
2010
97views more  TASLP 2010»
13 years 3 months ago
Hierarchical Bayesian Language Models for Conversational Speech Recognition
Traditional n-gram language models are widely used in state-of-the-art large vocabulary speech recognition systems. This simple model suffers from some limitations, such as overfi...
Songfang Huang, Steve Renals