Sciweavers

608 search results - page 28 / 122
» Random Systems with Complete Connections
Sort
View
KDD
2009
ACM
162views Data Mining» more  KDD 2009»
14 years 10 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
SPAA
2009
ACM
14 years 4 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
AML
2002
131views more  AML 2002»
13 years 9 months ago
Fuzzy logic, continuity and effectiveness
Abstract. It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbe...
Loredana Biacino, Giangiacomo Gerla
SAGA
2007
Springer
14 years 3 months ago
Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It considers scenarios of wireless networks in which the underlying environment has...
Artur Czumaj, Xin Wang
PKC
2007
Springer
189views Cryptology» more  PKC 2007»
14 years 3 months ago
Parallel Key-Insulated Public Key Encryption Without Random Oracles
Abstract. Key-insulated cryptography is a crucial technique for protecting private keys. To strengthen the security of key-insulated protocols, Hanaoka, Hanaoka and Imai recently i...
Benoît Libert, Jean-Jacques Quisquater, Moti...