Sciweavers

2540 search results - page 338 / 508
» Social Networks: An Introduction
Sort
View
SDM
2012
SIAM
294views Data Mining» more  SDM 2012»
13 years 4 months ago
Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
Tinghui Zhou, Hanhuai Shan, Arindam Banerjee, Guil...
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 4 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
LCN
2007
IEEE
15 years 8 months ago
CAT: A Cost-Aware BitTorrent
— With an enhanced client computer performance and network bandwidth, peer-to-peer (P2P) content distribution networks are receiving much attention. However, along with the popul...
Shusuke Yamazaki, Hideki Tode, Koso Murakami
104
Voted
CCR
2010
156views more  CCR 2010»
15 years 1 months ago
Workshop on internet economics (WIE2009) report
On September 23, 2009, CAIDA hosted a virtual Workshop on Internet Economics [3] to bring together network technology and policy researchers, commercial Internet facilities and se...
kc claffy
CIKM
2010
Springer
15 years 10 days ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...