8 search results - page 2 / 2 » Word Equations over Graph Products |
IJCAI
2003
13 years 9 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...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
In collaborative indexing systems users generate a big amount of metadata by labelling web-based content. These labels are known as tags and form a shared vocabulary. In order to u...