806 search results - page 103 / 162 » Lower Bounds on Correction Networks |
104
click to vote
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
SIROCCO
2004
15 years 1 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
103
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
115
click to vote
WAW
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
135
click to vote
WINET
2011
14 years 6 months ago
2011
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...