139 search results - page 21 / 28 » Sparse Projections over Graph |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
GMP
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
NIPS
2004
13 years 9 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
BIBE
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
SMI
2010
IEEE
13 years 6 months ago
2010
IEEE
—It has recently been shown that if we twist an arbitrary subset of edges of a mesh on an orientable surface, the resulting extended graph rotation system (EGRS) can be used to i...