Sciweavers

862 search results - page 64 / 173
» Random Information Spread in Networks
Sort
View
KDD
2009
ACM
162views Data Mining» more  KDD 2009»
16 years 5 months ago
TrustWalker: a random walk model for combining trust-based and item-based recommendation
Collaborative filtering is the most popular approach to build recommender systems and has been successfully employed in many applications. However, it cannot make recommendations ...
Mohsen Jamali, Martin Ester
ICOST
2009
Springer
15 years 11 months ago
Pervasive Informatics and Persistent Actimetric Information in Health Smart Homes
This paper discuss the ability to obtain a reliable pervasive information at home from a network of localizing sensors allowing to follow the different locations at which a depend...
Yannick Fouquet, Nicolas Vuillerme, Jacques Demong...
INFOCOM
2008
IEEE
15 years 11 months ago
Power-Adjusted Random Access to a Wireless Channel
—The operation of widely-deployed random access to wireless networks is based on limited information on the result of each access attempt. When making a random access attempt, us...
Young-June Choi, Kang G. Shin
ICDCN
2011
Springer
14 years 8 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
SPAA
2005
ACM
15 years 10 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay