4 search results - page 1 / 1 » Convergence Theorems For Some Layout Measures On Random Latt... |
135
click to vote
WG
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
125
click to vote
PPL
2000
15 years 3 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
129
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...