Sciweavers

2310 search results - page 187 / 462
» Coloring Random Graphs
Sort
View
ICPR
2006
IEEE
16 years 3 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
Horst Bunke, Michel Neuhaus
119
Voted
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
15 years 7 months ago
Spectral analysis of virus spreading in random geometric networks
— In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely rela...
Victor M. Preciado, Ali Jadbabaie
133
Voted
FSTTCS
2001
Springer
15 years 6 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
PAMI
2006
440views more  PAMI 2006»
15 years 2 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
CORR
2012
Springer
173views Education» more  CORR 2012»
13 years 10 months ago
A new approach to the orientation of random hypergraphs
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
Marc Lelarge