352 search results - page 18 / 71 » Partitioning Graphs into Connected Parts |
165
Voted
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper describes a technique for generating partition sequences of regions presenting long-term homogeneity in color and motion coherency in terms of affine models. The techni...
145
click to vote
DCC
2008
IEEE
16 years 5 months ago
2008
IEEE
For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part...
150
click to vote
CORR
2010
Springer
15 years 27 days ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
144
click to vote
HT
2009
ACM
16 years 13 days ago
2009
ACM
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
200
click to vote
SC
1993
ACM
15 years 10 months ago
1993
ACM
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed mapping procedure via a s...