Sciweavers

1456 search results - page 150 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
14 years 5 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
SPIN
2001
Springer
14 years 15 days ago
Addressing Dynamic Issues of Program Model Checking
Abstract. Model checking real programs has recently become an active research area. Programs however exhibit two characteristics that make model checking di cult: the complexity of...
Flavio Lerda, Willem Visser
IEICET
2008
136views more  IEICET 2008»
13 years 8 months ago
Bilingual Cluster Based Models for Statistical Machine Translation
We propose a domain specific model for statistical machine translation. It is wellknown that domain specific language models perform well in automatic speech recognition. We show ...
Hirofumi Yamamoto, Eiichiro Sumita
SIGIR
2008
ACM
13 years 8 months ago
A study of learning a merge model for multilingual information retrieval
This paper proposes a learning approach for the merging process in multilingual information retrieval (MLIR). To conduct the learning approach, we also present a large number of f...
Ming-Feng Tsai, Yu-Ting Wang, Hsin-Hsi Chen
BMCBI
2008
128views more  BMCBI 2008»
13 years 8 months ago
Finding sequence motifs with Bayesian models incorporating positional information: an application to transcription factor bindin
Background: Biologically active sequence motifs often have positional preferences with respect to a genomic landmark. For example, many known transcription factor binding sites (T...
Nak-Kyeong Kim, Kannan Tharakaraman, Leonardo Mari...