2314 search results - page 30 / 463 » Minimal Partitions of a Graph |
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
COCOON
2008
Springer
13 years 10 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
PC
2000
13 years 8 months ago
2000
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
SIAMDM
2010
13 years 6 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
MASCOTS
2003
13 years 9 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...