3008 search results - page 432 / 602 » Independence in connected graphs |
159
click to vote
CCCG
2007
15 years 8 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
148
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
199
click to vote
NIPS
2007
15 years 8 months ago
2007
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
193
click to vote
DICTA
2003
15 years 8 months ago
2003
Abstract. This paper introduces a two-level approach for image segmentation based on region and edge integration. Edges are first detected in the original image using a combinatio...
203
click to vote
NIPS
2004
15 years 8 months ago
2004
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....