If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...