402 search results - page 49 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
AMAI
2004
Springer
14 years 23 days ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
TCC
2012
Springer
12 years 2 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
In this paper we present a principled Bayesian method for detecting and segmenting instances of a particular object category within an image, providing a coherent methodology for ...
AI
2010
Springer
13 years 7 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...