299 search results - page 24 / 60 » Dispositional implementation solves the superfluous structur... |
WEA
2010
Springer
14 years 3 months ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
ICIP
2002
IEEE
14 years 10 months ago
2002
IEEE
In this paper, we present a novel information theoretic approach to image segmentation. We cast the segmentation problem as the maximization of the mutual information between the ...
NIPS
2003
13 years 9 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
SC
2003
ACM
14 years 1 months ago
2003
ACM
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...
APLAS
2005
ACM
14 years 2 months ago
2005
ACM
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...