982 search results - page 177 / 197 » Solving Steiner tree problems in graphs to optimality |
TOC
2008
13 years 7 months ago
2008
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
GECCO
2010
Springer
14 years 15 days ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...