982 search results - page 154 / 197 » Solving Steiner tree problems in graphs to optimality |
129
click to vote
AAAI
2011
14 years 15 days ago
2011
We present a dual decomposition approach to the treereweighted belief propagation objective. Each tree in the tree-reweighted bound yields one subproblem, which can be solved with...
107
click to vote
PODC
2005
ACM
15 years 6 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
118
Voted
CIKM
2010
Springer
14 years 7 months ago
2010
Springer
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
99
Voted
AAAI
1998
15 years 1 months ago
1998
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
105
click to vote
IR
2010
14 years 11 months ago
2010
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...