1480 search results - page 138 / 296 » Distributed algorithms for weighted problems in sparse graph... |
CACM
2008
15 years 22 days ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
141
click to vote
ICDAR
2011
IEEE
14 years 7 days ago
2011
IEEE
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
121
click to vote
ICDM
2010
IEEE
14 years 10 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
99
Voted
ICIP
2010
IEEE
14 years 10 months ago
2010
IEEE
We develop a new passive image formation method capable of exploiting information about multiple scattering in the environment using measurements from a sparse array of receivers ...
120
click to vote
ICIP
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...