Sciweavers

1542 search results - page 108 / 309
» The metamathematics of random graphs
Sort
View
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
15 years 8 months ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
126
Voted
ICPR
2006
IEEE
16 years 2 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
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
15 years 6 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
131
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 1 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