511 search results - page 5 / 103 » The intrinsic dimensionality of graphs |
CVPR
2007
IEEE
14 years 4 months ago
2007
IEEE
We present the Conformal Embedding Analysis (CEA) for feature extraction and dimensionality reduction. Incorporating both conformal mapping and discriminating analysis, CEA projec...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
— We propose an axiomatic approach to the concept of an intrinsic dimension of a dataset, based on a viewpoint of geometry of high-dimensional structures. Our first axiom postul...
DLT
2008
13 years 11 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
NIPS
2007
13 years 11 months ago
2007
We present a simple variant of the k-d tree which automatically adapts to intrinsic low dimensional structure in data.