Sciweavers

776 search results - page 8 / 156
» Distributed Information Regularization on Graphs
Sort
View
90
Voted
ICALP
2009
Springer
15 years 7 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
CIKM
2011
Springer
14 years 9 days ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
107
Voted
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 13 days ago
Schnyder decompositions for regular plane graphs and application to drawing
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
Olivier Bernardi, Éric Fusy
MM
2009
ACM
269views Multimedia» more  MM 2009»
15 years 6 months ago
Semi-supervised topic modeling for image annotation
We propose a novel technique for semi-supervised image annotation which introduces a harmonic regularizer based on the graph Laplacian of the data into the probabilistic semantic ...
Yuanlong Shao, Yuan Zhou, Xiaofei He, Deng Cai, Hu...