511 search results - page 64 / 103 » The intrinsic dimensionality of graphs |
IDA
1999
Springer
14 years 2 months ago
1999
Springer
Grand tour is a method for viewing multidimensional data via linear projections onto a sequence of two dimensional subspaces and then moving continuously from one projection to the...
CVPR
2008
IEEE
14 years 12 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
DASFAA
2007
IEEE
14 years 4 months ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
EJC
2007
13 years 10 months ago
2007
Let Φ be an irreducible root system and ∆ be a base for Φ; it is well known that any root in Φ is an integral combination of the roots in ∆. In comparison to this fact, we ...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...