Sciweavers

4757 search results - page 670 / 952
» Monads for Functional Programming
Sort
View
CIE
2009
Springer
16 years 1 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy
COCOON
2009
Springer
16 years 1 months ago
Computing Bond Types in Molecule Graphs
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...
Sebastian Böcker, Quang Bao Anh Bui, Patrick ...
DNA
2009
Springer
185views Bioinformatics» more  DNA 2009»
16 years 1 months ago
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
Knowledge of energy barriers between pairs of secondary structures for a given DNA or RNA molecule is useful, both in understanding RNA function in biological settings and in desig...
Ján Manuch, Chris Thachuk, Ladislav Stacho,...
FM
2009
Springer
104views Formal Methods» more  FM 2009»
16 years 1 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene
LOPSTR
2009
Springer
16 years 1 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
José Iborra, Naoki Nishida, Germán V...