Sciweavers

841 search results - page 159 / 169
» Approximability of Minimum AND-Circuits
Sort
View
COCOA
2009
Springer
14 years 9 days ago
Variable-Size Rectangle Covering
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang
EMMCVPR
2001
Springer
14 years 4 days ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
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...
Yuri Boykov, Vladimir Kolmogorov
EMMCVPR
2001
Springer
14 years 4 days ago
A Double-Loop Algorithm to Minimize the Bethe Free Energy
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
Alan L. Yuille
INFOCOM
2000
IEEE
14 years 1 days ago
Wavelength Assignment in WDM Rings to Minimize SONET ADMs
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
Liwu Liu, Xiang-Yang Li, Peng-Jun Wan, Ophir Fried...
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
14 years 7 hour ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg