2079 search results - page 190 / 416 » Universality of random graphs |
184
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 ...
182
click to vote
IBPRIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
193
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
213
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
158
click to vote
INFOCOM
2008
IEEE
16 years 29 days ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...