Sciweavers

1439 search results - page 112 / 288
» Fast approximation of centrality
Sort
View
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
14 years 8 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...
ICASSP
2011
IEEE
14 years 1 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
DC
2011
13 years 9 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
ICIP
2002
IEEE
15 years 11 months ago
A recognition algorithm for Chinese characters in diverse fonts
This paper proposes an algorithm for recognizing Chinese characters in many diverse fonts including Song, Fang, Kai, Hei, Yuan, Lishu, Weibei, and Xingkai. The algorithm is based ...
Xianli Wu, Min Wu
ICC
2007
IEEE
340views Communications» more  ICC 2007»
15 years 4 months ago
A Decentralized Positioning Method for Wireless Sensor Networks Based on Weighted Interpolation
— A decentralized sensor positioning algorithm is proposed using an adaptive weighted-interpolation method. The proposed method utilizes in-network processing among sensors to co...
Chin-Liang Wang, Yao-Win Hong, Yu-Sheng Dai