3267 search results - page 251 / 654 » Generalized quasirandom graphs |
204
click to vote
PAMI
2007
15 years 6 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
192
click to vote
BMVC
2010
15 years 4 months ago
2010
In this paper, we present a graph-based image segmentation method (patch-cuts) that incorporates features and spatial relations obtained from image patches. In the first step, pat...
208
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
206
click to vote
COMPGEOM
2004
ACM
16 years 10 days ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
172
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...