Sciweavers

2816 search results - page 233 / 564
» Submodular function minimization
Sort
View
IOR
2007
89views more  IOR 2007»
15 years 6 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
SODA
2012
ACM
173views Algorithms» more  SODA 2012»
13 years 9 months ago
Resource augmentation for weighted flow-time explained by dual fitting
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
S. Anand 0002, Naveen Garg, Amit Kumar
181
Voted
CVPR
2009
IEEE
17 years 1 months ago
Global Active Contour-based Image Segmentation via Probability Alignment
Active contours is a popular technique for image segmentation. However, active contour tend to converge to the closest local minimum of its energy function and often requires a ...
Andriy Myronenko, Xubo B. Song
182
Voted
CVPR
2007
IEEE
16 years 8 months ago
Joint Optimization of Cascaded Classifiers for Computer Aided Detection
The existing methods for offline training of cascade classifiers take a greedy search to optimize individual classifiers in the cascade, leading inefficient overall performance. W...
Murat Dundar, Jinbo Bi
205
Voted
CVPR
2007
IEEE
16 years 8 months ago
Mumford-Shah Meets Stereo: Integration of Weak Depth Hypotheses
Recent results on stereo indicate that an accurate segmentation is crucial for obtaining faithful depth maps. Variational methods have successfully been applied to both image segm...
Thomas Pock, Christopher Zach, Horst Bischof