Sciweavers

289 search results - page 57 / 58
» adhoc 2006
Sort
View
COMPGEOM
2006
ACM
13 years 11 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
PODC
2006
ACM
13 years 11 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
WOWMOM
2006
ACM
135views Multimedia» more  WOWMOM 2006»
13 years 11 months ago
MCMSDA: A Multi-Channel Multi-Sector Directional Antenna Wireless LAN
Recently there is an increasing interest in using directional antennas and multi-channel for Ad-hoc wireless networks. Directional antennas provide higher capacity and less multi-...
Yong Huang, Weibo Gong, Dev Gupta
ACMMSP
2006
ACM
226views Hardware» more  ACMMSP 2006»
13 years 9 months ago
Smarter garbage collection with simplifiers
We introduce a method for providing lightweight daemons, called simplifiers, that attach themselves to program data. If a data item has a simplifier, the simplifier may be run aut...
Melissa E. O'Neill, F. Warren Burton
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 9 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...