Sciweavers

Share
4 search results - page 1 / 1
» Convergence Theorems For Some Layout Measures On Random Latt...
Sort
View
WG
1999
Springer
10 years 8 months ago
Linear Orderings of Random Geometric Graphs
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...
Josep Díaz, Mathew D. Penrose, Jordi Petit,...
PPL
2000
110views more  PPL 2000»
10 years 3 months ago
Faulty Random Geometric Networks
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 ...
Josep Díaz, Jordi Petit, Maria J. Serna
ICCV
2003
IEEE
11 years 6 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
books