Sciweavers

733 search results - page 76 / 147
» Recommending random walks
Sort
View
IMAMS
2003
125views Mathematics» more  IMAMS 2003»
14 years 11 months ago
A Graph-Spectral Method for Surface Height Recovery
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
Antonio Robles-Kelly, Edwin R. Hancock
PAMI
2006
141views more  PAMI 2006»
14 years 9 months ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee
SIAMSC
2008
132views more  SIAMSC 2008»
14 years 9 months ago
Stochastic Preconditioning for Diagonally Dominant Matrices
Abstract. This paper presents a new stochastic preconditioning approach for large sparse matrices. For the class of matrices that are row-wise and column-wise irreducibly diagonall...
Haifeng Qian, Sachin S. Sapatnekar
SIGMETRICS
2008
ACM
131views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
On the design of hybrid peer-to-peer systems
In this paper, we consider hybrid peer-to-peer systems where users form an unstructured peer-to-peer network with the purpose of assisting a server in the distribution of data. We...
Stratis Ioannidis, Peter Marbach
JSAC
2007
124views more  JSAC 2007»
14 years 9 months ago
Optimal search performance in unstructured peer-to-peer networks with clustered demands
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
Saurabh Tewari, Leonard Kleinrock