256 search results - page 30 / 52 » Sparse random graphs with clustering |
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
ICALP
1992
Springer
13 years 11 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed āmanifold-motivatedā...
IPMI
2009
Springer
14 years 4 days ago
2009
Springer
Abstract. In this paper we propose a novel approach to deļ¬ne task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
CAAN
2004
Springer
14 years 29 days ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...