843 search results - page 91 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
302
click to vote
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
123
click to vote
IEEECIT
2009
IEEE
15 years 8 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
110
click to vote
EMMCVPR
2001
Springer
15 years 6 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
140
click to vote
NN
2000
Springer
15 years 1 months ago
2000
Springer
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
116
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...