1033 search results - page 62 / 207 » Redistribution in distributed Ada |
MOBIHOC
2002
ACM
14 years 9 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
MOBIHOC
2002
ACM
14 years 9 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
SIGCOMM
2009
ACM
14 years 4 months ago
2009
ACM
We consider the problem of interconnecting a simple type of social network: Instant Messaging services. Today, users are members of various IM communities such as AOL, Yahoo, and ...
SIGCOMM
2009
ACM
14 years 4 months ago
2009
ACM
We define some interesting incentive issues that arise in the management of virtual infrastructures. We demonstrate that participants’ decisions about the quantities of infrast...
SIGCOMM
2009
ACM
14 years 4 months ago
2009
ACM
Mobile phones are becoming a convergent platform for sensing, computation, and communication. This paper envisions VUPoints, a collaborative sensing and video-recording system tha...