666 search results - page 71 / 134 » Unbalanced Graph Cuts |
166
Voted
MVA
2008
15 years 2 months ago
2008
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
128
click to vote
ICCAD
2009
IEEE
15 years 10 days ago
2009
IEEE
Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the...
113
click to vote
STOC
2001
ACM
16 years 2 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
108
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—Communication networks are vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an Electromagnetic Pulse (EMP) attack. Such r...
145
Voted
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...