4047 search results - page 288 / 810 » The Discrete Basis Problem |
142
click to vote
MICCAI
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we introduce a novel approach to bridge the gap between the landmark-based and the iconic-based voxel-wise registration methods. The registration problem is formulat...
169
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
174
click to vote
CPAIOR
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
152
click to vote
CORR
2012
Springer
14 years 14 days ago
2012
Springer
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
166
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...