355 search results - page 44 / 71 » An Algorithmic Solution of a Birkhoff Type Problem |
BMCBI
2006
13 years 7 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
CIARP
2007
Springer
14 years 1 months ago
2007
Springer
In order to deploy mobile robots in social environments like indoor buildings, they need to be provided with perceptual abilities to detect people. In the computer vision literatur...
CP
2007
Springer
14 years 1 months ago
2007
Springer
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...
UAI
2008
13 years 8 months ago
2008
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
AI
2000
Springer
13 years 7 months ago
2000
Springer
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Evidence suggests that credal ...