977 search results - page 24 / 196 » Permuting Web Graphs |
100
click to vote
IFIP12
2009
14 years 9 months ago
2009
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
SIAMDM
2010
14 years 6 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
80
Voted
DM
2008
14 years 11 months ago
2008
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...
158
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...