843 search results - page 79 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
138
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
135
click to vote
TMC
2012
13 years 3 months ago
2012
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
131
click to vote
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been t...
127
Voted
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
141
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...