511 search results - page 8 / 103 » The intrinsic dimensionality of graphs |
ICASSP
2009
IEEE
13 years 7 months ago
2009
IEEE
An analysis of quaternion-valued intrinsic mode functions (IMFs) within three dimensional empirical mode decomposition is presented. This is achieved by using the delay vector var...
IEEECIT
2005
IEEE
14 years 3 months ago
2005
IEEE
Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with si...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
Non-linear dimensionality reductionmethods are powerful techniques to deal with
high-dimensional datasets. However, they often are susceptible to local minima
and perform poorly ...
GD
2004
Springer
14 years 3 months ago
2004
Springer
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
GD
2003
Springer
14 years 3 months ago
2003
Springer
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges ...