Sciweavers

580 search results - page 73 / 116
» Choosing a random peer
Sort
View
RECSYS
2009
ACM
15 years 6 months ago
Collaborative prediction and ranking with non-random missing data
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ...
Benjamin M. Marlin, Richard S. Zemel
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
15 years 6 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
SP
2008
IEEE
117views Security Privacy» more  SP 2008»
15 years 6 months ago
Anonymous Networking with Minimum Latency in Multihop Networks
The problem of security against timing based traffic analysis in multihop networks is considered in this work. In particular, the relationship between the level of anonymity prov...
Parvathinathan Venkitasubramaniam, Lang Tong
SOFSEM
2007
Springer
15 years 6 months ago
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Ku...
IAT
2006
IEEE
15 years 6 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler