511 search results - page 14 / 103 » The intrinsic dimensionality of graphs |
115
click to vote
ICML
2005
IEEE
16 years 19 days ago
2005
IEEE
This paper explores the issue of recognizing, generalizing and reproducing arbitrary gestures. We aim at extracting a representation that encapsulates only the key aspects of the ...
178
click to vote
ICDE
2000
IEEE
16 years 1 months ago
2000
IEEE
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
105
click to vote
NIPS
1997
15 years 1 months ago
1997
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
TCS
2008
14 years 11 months ago
2008
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
APVIS
2004
15 years 1 months ago
2004
Two and a half dimensional graph visualisation is the stacking of a set of related graphs into the third dimension to support visual comparison. A new aesthetic criterion is intro...