110 search results - page 6 / 22 » On Constructing k-Connected k-Dominating Set in Wireless Net... |
86
Voted
WMTE
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper presents a working prototype of a mobile, programmable set of construction kit elements for children. SmartTiles are small, lightweight, independently programmable tile...
128
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
PERCOM
2007
ACM
15 years 11 months ago
2007
ACM
The notion of "pervasive computing" has traditionally been identified with a focus on what might be called "pervasive processing". This paper, in contrast, argu...
125
click to vote
OL
2011
14 years 6 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
110
Voted
TMC
2011
14 years 6 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...