Sciweavers

76 search results - page 7 / 16
» Judicious partitions of directed graphs
Sort
View
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
13 years 9 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
DM
2008
75views more  DM 2008»
13 years 9 months ago
Homogeneous factorisations of graph products
A homogeneous factorisation of a digraph consists of a partition P = {P1, . . . , Pk} of the arc set A and two vertex-transitive subgroups M G Aut() such that M fixes each Pi set...
Michael Giudici, Cai Heng Li, Primoz Potocnik, Che...
CAIP
2005
Springer
114views Image Analysis» more  CAIP 2005»
14 years 3 months ago
A Segmentation Algorithm for Noisy Images
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...
Soufiane Rital, Hocine Cherifi, Serge Miguet
IPPS
2006
IEEE
14 years 3 months ago
Towards a parallel framework of grid-based numerical algorithms on DAGs
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...
Zeyao Mo, Aiqing Zhang, Xiaolin Cao
WWW
2008
ACM
14 years 10 months ago
Graph theoretical framework for simultaneously integrating visual and textual features for efficient web image clustering
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
Manjeet Rege, Ming Dong, Jing Hua