3267 search results - page 332 / 654 » Generalized quasirandom graphs |
158
Voted
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
169
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
144
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
167
click to vote
ICALP
2007
Springer
16 years 28 days ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
168
click to vote
WADS
2007
Springer
16 years 26 days ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...