1221 search results - page 132 / 245 » Balanced graph partitioning |
ICIP
2008
IEEE
14 years 4 months ago
2008
IEEE
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
DAM
1999
13 years 9 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
COCOON
2003
Springer
14 years 3 months ago
2003
Springer
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...