Sciweavers

125 search results - page 25 / 25
» Non-Exposure Location Anonymity
Sort
View
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
13 years 11 months ago
Polynomial Deterministic Rendezvous in Arbitrary Graphs
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
Dariusz R. Kowalski, Andrzej Pelc
MOBIHOC
2008
ACM
14 years 5 months ago
Efficient binary schemes for training heterogeneous sensor and actor networks
Sensor networks are expected to evolve into long-lived, autonomous networked systems whose main mission is to provide in-situ users ? called actors ? with real-time information in...
Ferruccio Barsi, Alfredo Navarra, Maria Cristina P...
GROUP
2009
ACM
14 years 8 days ago
WaterCooler: exploring an organization through enterprise social media
As organizations scale up, their collective knowledge increases, and the potential for serendipitous collaboration between members grows dramatically. However, finding people wit...
Michael J. Brzozowski
ISORC
2002
IEEE
13 years 10 months ago
IKE 2-Implementing the Stateful Distributed Object Paradigm
— This paper describes IKE 2, which is distributed object computing middleware that supports the creation of interoperable realtime distributed applications. These applications a...
J. Russell Noseworthy
POPL
1999
ACM
13 years 10 months ago
Types for Mobile Ambients
An ambient is a named cluster of processes and subambients, which moves as a group. We describe type systems able to guarantee that certain ambients will remain immobile, and that ...
Luca Cardelli, Andrew D. Gordon