181 search results - page 12 / 37 » Learning bayesian networks consistent with the optimal branc... |
CCO
2001
Springer
13 years 12 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Many classes of images have the characteristics of sparse structuring of statistical dependency and the presence of conditional independencies among various groups of variables. S...
JMLR
2008
13 years 7 months ago
2008
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Source Code
A library for developing portable applications that deal with networking, threads (message passing, futures, etc...), graphical interfaces, complex data structures, linear algebra,...
ESANN
2001
13 years 8 months ago
2001
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...