Sciweavers

850 search results - page 139 / 170
» The structure of information pathways in a social communicat...
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
HT
2006
ACM
14 years 1 months ago
HT06, tagging paper, taxonomy, Flickr, academic article, to read
In recent years, tagging systems have become increasingly popular. These systems enable users to add keywords (i.e., “tags”) to Internet resources (e.g., web pages, images, vi...
Cameron Marlow, Mor Naaman, Danah Boyd, Marc Davis
DEBU
2010
180views more  DEBU 2010»
13 years 8 months ago
Searching RDF Graphs with SPARQL and Keywords
The proliferation of knowledge-sharing communities like Wikipedia and the advances in automated information extraction from Web pages enable the construction of large knowledge ba...
Shady Elbassuoni, Maya Ramanath, Ralf Schenkel, Ge...
IPSN
2007
Springer
14 years 2 months ago
Exact distributed Voronoi cell computation in sensor networks
Distributed computation of Voronoi cells in sensor networks, i.e. computing the locus of points in a sensor field closest to a given sensor, is a key building block that supports...
Boulat A. Bash, Peter Desnoyers
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 12 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve