779 search results - page 10 / 156 » Spectral Generative Models for Graphs |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
NIPS
2003
13 years 9 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
SPAA
1997
ACM
14 years 17 days ago
1997
ACM
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
AAAI
2007
13 years 10 months ago
2007
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...