62 search results - page 2 / 13 » Exact Covers via Determinants |
Publication
We present a class of models that, via a simple construction,
enables exact, incremental, non-parametric, polynomial-time,
Bayesian inference of conditional measures. The approac...
BMCBI
2008
13 years 4 months ago
2008
Background: Protein-amide proton hydrogen-deuterium exchange (HDX) is used to investigate protein conformation, conformational changes and surface binding sites for other molecule...
COR
2007
13 years 5 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
ACTA
2007
13 years 5 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...