11381 search results - page 1938 / 2277 » Connectivity |
175
click to vote
MOBIHOC
2004
ACM
16 years 5 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
177
click to vote
INFOCOM
2009
IEEE
16 years 24 days ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
140
Voted
APPROX
2007
Springer
16 years 10 days ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
190
click to vote
COMPGEOM
2006
ACM
16 years 3 days ago
2006
ACM
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
169
Voted
ISPA
2005
Springer
15 years 11 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...