511 search results - page 20 / 103 » The intrinsic dimensionality of graphs |
103
click to vote
IVC
2007
14 years 11 months ago
2007
Many natural image sets are samples of a low-dimensional manifold in the space of all possible images. When the image data set is not a linear combination of a small number of bas...
AUTOMATICA
2007
2007
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence
14 years 12 months ago
In this paper, we generalize the notion of persistence, which has been originally introduced for two-dimensional formations, to Rd for d 3, seeking to provide a theoretical framew...
SPDP
1991
IEEE
15 years 3 months ago
1991
IEEE
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...
113
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
115
click to vote
WEBI
2010
Springer
14 years 9 months ago
2010
Springer
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...