511 search results - page 12 / 103 » The intrinsic dimensionality of graphs |
APVIS
2010
14 years 11 months ago
2010
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through...
JGT
2007
14 years 9 months ago
2007
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
126
click to vote
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
PCM
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we propose a new scheme for the geometry coding of three-dimensional (3-D) mesh models using a dual graph. In order to compress the mesh geometry information, we gen...
80
Voted
IBPRIA
2003
Springer
15 years 2 months ago
2003
Springer
The dimensionality of the input data often far exceeds their intrinsic dimensionality. As a result, it may be difficult to recognize multidimensional data, especially if the number...