Sciweavers

2924 search results - page 361 / 585
» Lower Bounds in Distributed Computing
Sort
View
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
15 years 2 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
129
Voted
TOMS
2011
101views more  TOMS 2011»
14 years 11 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
MOBIHOC
2012
ACM
13 years 7 months ago
Stability analyses of longest-queue-first link scheduling in MC-MR wireless networks
Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless networks. Its stability performance in single-channel single-radio (SC-SR) wireless net...
Peng-Jun Wan, XiaoHua Xu, Zhu Wang, ShaoJie Tang, ...
CLUSTER
2004
IEEE
15 years 8 months ago
Hierarchical Bloom filter arrays (HBA): a novel, scalable metadata management system for large cluster-based storage
An efficient and distributed scheme for file mapping or file lookup scheme is critical in decentralizing metadata management within a group of metadata servers. This paper present...
Yifeng Zhu, Hong Jiang, Jun Wang
CIMAGING
2008
104views Hardware» more  CIMAGING 2008»
15 years 6 months ago
MCMC curve sampling and geometric conditional simulation
We present an algorithm to generate samples from probability distributions on the space of curves. Traditional curve evolution methods use gradient descent to find a local minimum...
Ayres C. Fan, John W. Fisher III, Jonathan Kane, A...