Sciweavers

115 search results - page 6 / 23
» Using Random Subsets to Build Scalable Network Services
Sort
View
ICDCS
2009
IEEE
14 years 3 months ago
Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks
Massive collaborative editing becomes a reality through leading projects such as Wikipedia. This massive collaboration is currently supported with a costly central service. In ord...
Stéphane Weiss, Pascal Urso, Pascal Molli
IJCAI
2003
13 years 10 months ago
Collaborative Filtering Using Associative Neural Memory
There are two types of collaborative filtering (CF) systems, user-based and item-based. This paper introduces an item-based CF system for ranking derived from Linear Associative ...
Chuck P. Lam
ICDCS
2007
IEEE
14 years 2 months ago
Differentiated Data Persistence with Priority Random Linear Codes
Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable...
Yunfeng Lin, Baochun Li, Ben Liang
IPSN
2005
Springer
14 years 2 months ago
Design of a wireless sensor network platform for detecting rare, random, and ephemeral events
— We present the design of the eXtreme Scale Mote, a new sensor network platform for reliably detecting and classifying, and quickly reporting, rare, random, and ephemeral events...
Prabal Dutta, Mike Grimmer, Anish Arora, Steven B....
IPPS
2008
IEEE
14 years 3 months ago
Scalable data dissemination using hybrid methods
Web server scalability can be greatly enhanced via hybrid data dissemination methods that use both unicast and multicast. Hybrid data dissemination is particularly promising due t...
Wenhui Zhang, Vincenzo Liberatore, Jonathan Beaver...