206 search results - page 37 / 42 » Ant colony optimization and the minimum cut problem |
131
Voted
ICCV
2011
IEEE
14 years 15 days ago
2011
IEEE
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
118
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...
91
Voted
SODA
1997
ACM
15 years 1 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
112
click to vote
PPOPP
2005
ACM
15 years 6 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
108
click to vote
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...