Sciweavers

4 search results - page 1 / 1
» Word maps and spectra of random graph lifts
Sort
View
RSA
2010
94views more  RSA 2010»
13 years 2 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
RECOMB
2004
Springer
14 years 4 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
USENIX
2007
13 years 6 months ago
A Comparison of Structured and Unstructured P2P Approaches to Heterogeneous Random Peer Selection
Random peer selection is used by numerous P2P applications; examples include application-level multicast, unstructured file sharing, and network location mapping. In most of thes...
Vivek Vishnumurthy, Paul Francis
ACCV
2009
Springer
13 years 11 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee