352 search results - page 25 / 71 » Partitioning Graphs into Connected Parts |
173
click to vote
ICDAR
2011
IEEE
14 years 3 months 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...
101
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...
176
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
146
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
123
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
We present a novel approach to plan recognition based on a two-stage paradigm of graph construction and analysis. First, a graph structure called a Goal Graph is constructed to rep...