Sciweavers

14 search results - page 2 / 3
» Bounded Memory Dolev-Yao Adversaries in Collaborative System...
Sort
View
SPAA
2004
ACM
13 years 11 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
SPAA
2009
ACM
14 years 2 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
SRDS
2007
IEEE
13 years 11 months ago
Distributed Software-based Attestation for Node Compromise Detection in Sensor Networks
Sensors that operate in an unattended, harsh or hostile environment are vulnerable to compromises because their low costs preclude the use of expensive tamper-resistant hardware. ...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
JMLR
2010
156views more  JMLR 2010»
13 years 7 days ago
Collaborative Filtering on a Budget
Matrix factorization is a successful technique for building collaborative filtering systems. While it works well on a large range of problems, it is also known for requiring signi...
Alexandros Karatzoglou, Alexander J. Smola, Markus...
BIRTHDAY
2003
Springer
13 years 10 months ago
Distributed Cooperation and Adversity: Complexity Trade-Offs
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
Chryssis Georgiou, Alexander Russell, Alexander A....