Sciweavers

1712 search results - page 37 / 343
» A Computational Approach to Binding Theory
Sort
View
BMCBI
2007
148views more  BMCBI 2007»
14 years 12 months ago
WeederH: an algorithm for finding conserved regulatory motifs and regions in homologous sequences
Background: This work addresses the problem of detecting conserved transcription factor binding sites and in general regulatory regions through the analysis of sequences from homo...
Giulio Pavesi, Federico Zambelli, Graziano Pesole
LLC
2011
123views more  LLC 2011»
14 years 6 months ago
Computational Phonology - Part I: Foundations
Computational phonology approaches the study of sound patterns in the world’s languages from a computational perspective. This article explains this perspective and its relevanc...
Jeffrey Heinz
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
14 years 10 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
ICALP
2004
Springer
15 years 5 months ago
Deciding Knowledge in Security Protocols Under Equational Theories
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
Martín Abadi, Véronique Cortier
CGF
2005
98views more  CGF 2005»
14 years 11 months ago
Spectral Volume Rendering based on the Kubelka-Munk Theory
Colour realism plays an important role in computer graphics and visualization. In this paper, we present a new approach to direct volume rendering based on the Kubelka-Munk theory...
Alfie Abdul-Rahman, Min Chen