Sciweavers

776 search results - page 1 / 156
» Distributed Information Regularization on Graphs
Sort
View
NIPS
2004
13 years 5 months ago
Distributed Information Regularization on Graphs
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expres...
Adrian Corduneanu, Tommi Jaakkola
SPAA
2005
ACM
13 years 10 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Peter Mahlmann, Christian Schindelhauer
ICASSP
2011
IEEE
12 years 8 months ago
Multi-graph regularization for efficient delivery of user generated content in online social networks
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
Jacob Chakareski
SIGIR
2008
ACM
13 years 4 months ago
Learning query intent from regularized click graphs
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
Xiao Li, Ye-Yi Wang, Alex Acero
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 6 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou