796 search results - page 95 / 160 » The Anonymous Subgraph Problem |
100
Voted
ALGOSENSORS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, a...
CSE
2009
IEEE
15 years 5 months ago
2009
IEEE
—Event schedulers, well-known from groupware and social software, typically share the problem that they disclose detailed availability patterns of their users. This paper disting...
100
Voted
IFIP11
2004
15 years 2 months ago
2004
This paper presents an analysis of mixes and dummy traffic policies, which are building blocks of anonymous services. The goal of the paper is to bring together all the issues rela...
88
Voted
CCR
2010
14 years 10 months ago
2010
This is a brief journey across the Internet privacy landscape. After trying to convince you about the importance of the problem I will try to present questions of interest and how...
114
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...