Sciweavers

477 search results - page 80 / 96
» Landmark-Based Information Storage and Retrieval in Sensor N...
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 18 days 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
WWW
2011
ACM
13 years 3 months ago
we.b: the web of short urls
Short URLs have become ubiquitous. Especially popular within social networking services, short URLs have seen a significant increase in their usage over the past years, mostly du...
Demetres Antoniades, Iasonas Polakis, Georgios Kon...
MOBIDE
2003
ACM
14 years 1 months ago
Consistency mechanisms for a distributed lookup service supporting mobile applications
This paper presents a general-purpose distributed lookup service, denoted Passive Distributed Indexing (PDI). PDI stores entries in form of (key, value) pairs in index caches loca...
Christoph Lindemann, Oliver P. Waldhorst
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 8 months ago
Emergence of Spontaneous Order Through Neighborhood Formation in Peer-to-Peer Recommender Systems
The advent of the Semantic Web necessitates paradigm shifts away from centralized client/server architectures towards decentralization and peer-to-peer computation, making the exi...
Ernesto Diaz-Aviles, Lars Schmidt-Thieme, Cai-Nico...
WWW
2005
ACM
14 years 9 months ago
GlobeDB: autonomic data replication for web applications
We present GlobeDB, a system for hosting Web applications that performs autonomic replication of application data. GlobeDB offers data-intensive Web applications the benefits of l...
Swaminathan Sivasubramanian, Gustavo Alonso, Guill...