3049 search results - page 403 / 610 » On the Convergence of Bound Optimization Algorithms |
116
Voted
SIAMJO
2008
15 years 4 months ago
2008
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
139
click to vote
TMC
2008
15 years 4 months ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
249
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
125
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
133
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...