Sciweavers

767 search results - page 56 / 154
» On Clustering Using Random Walks
Sort
View
GRAPHICSINTERFACE
2001
13 years 10 months ago
Corrosion: Simulating and Rendering
Weathering phenomena represent a topic of growing interest in computer graphics, and corrosion reactions are of great importance since they affect a large number of different fiel...
Stéphane Mérillou, Jean-Michel Disch...
WWW
2010
ACM
13 years 9 months ago
LINKREC: a unified framework for link recommendation with user attributes and graph structure
With the phenomenal success of networking sites (e.g., Facebook, Twitter and LinkedIn), social networks have drawn substantial attention. On online social networking sites, link r...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han
CORR
2011
Springer
136views Education» more  CORR 2011»
13 years 3 months ago
Degree Fluctuations and the Convergence Time of Consensus Algorithms
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
Alexander Olshevsky, John N. Tsitsiklis
FOCS
2009
IEEE
14 years 3 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer
SIAMSC
2008
132views more  SIAMSC 2008»
13 years 8 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