511 search results - page 16 / 103 » The intrinsic dimensionality of graphs |
GD
2001
Springer
14 years 2 months ago
2001
Springer
IPPS
1997
IEEE
14 years 2 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
COMGEO
1998
ACM
13 years 9 months ago
1998
ACM
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
IJCAI
2003
13 years 11 months ago
2003
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...