Sciweavers

1171 search results - page 146 / 235
» Multisource Algorithmic Information Theory
Sort
View
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 9 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
MOBIHOC
2004
ACM
14 years 9 months ago
Internal synchronization of drift-constraint clocks in ad-hoc sensor networks
Clock synchronization is a crucial basic service in typical sensor networks, since the observations of distributed sensors more often than not need to be ordered ("a happened...
Lennart Meier, Philipp Blum, Lothar Thiele
PODC
2006
ACM
14 years 3 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
SPAA
2010
ACM
13 years 9 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
NIPS
2004
13 years 10 months ago
Maximising Sensitivity in a Spiking Network
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
Anthony J. Bell, Lucas C. Parra