511 search results - page 48 / 103 » The intrinsic dimensionality of graphs |
181
click to vote
NIPS
2001
15 years 7 months ago
2001
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
205
click to vote
MM
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
149
click to vote
SOFSEM
2005
Springer
15 years 11 months ago
2005
Springer
d Abstract) Lubomir Torok Institute of Mathematics and Computer Science Slovak Academy of Sciences Severna 5, 974 01 Banska Bystrica, Slovak Republic 3-dimensional layout of graph...
184
click to vote
ALGOSENSORS
2004
Springer
15 years 11 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
125
click to vote
INFOCOM
2006
IEEE
16 years 5 days ago
2006
IEEE
— In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tradition...