256 search results - page 30 / 52 » Sparse random graphs with clustering |
79
Voted
ICPR
2008
IEEE
15 years 6 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...
102
click to vote
ICALP
1992
Springer
15 years 3 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
15 years 5 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ā...
105
click to vote
IPMI
2009
Springer
15 years 4 months 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
15 years 5 months 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 ...