Sciweavers

1204 search results - page 144 / 241
» Hybrid Probabilistic Programs
Sort
View
146
Voted
BMCBI
2002
108views more  BMCBI 2002»
15 years 20 days ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
EMSOFT
2006
Springer
15 years 4 months ago
An analysis framework for network-code programs
Distributed real-time systems require a predictable and verifiable mechanism to control the communication medium. Current real-time communication protocols are typically independe...
Madhukar Anand, Sebastian Fischmeister, Insup Lee
102
Voted
PLDI
2009
ACM
15 years 7 months ago
Language-based security on Android
In this paper, we initiate a formal study of security on Android: Google’s new open-source platform for mobile devices. Specifically, we present a core typed language to descri...
Avik Chaudhuri
AGILEDC
2006
IEEE
15 years 7 months ago
The Pairing Session as the Atomic Unit of Work
We have an Extreme Programming team at a small company dedicated to the Agile approach. Our team of 7 developers decided to use the pairing session as the fundamental unit of work...
Troy Frever, Paul Ingalls
104
Voted
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 27 days ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...