1612 search results - page 53 / 323 » Analysing Randomized Distributed Algorithms |
WONS
2005
IEEE
15 years 3 months ago
2005
IEEE
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
100
click to vote
TMC
2008
14 years 9 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
103
click to vote
WAW
2007
Springer
15 years 3 months ago
2007
Springer
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Until now, structured and unstructured networks have been considered in absentia of each other. We believe that next-generation P2P services will require both structured and unstr...
CRYPTO
2012
Springer
13 years 6 days ago
2012
Springer
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...