Sciweavers

242 search results - page 18 / 49
» Approximately uniform random sampling in sensor networks
Sort
View
IJWIN
2006
209views more  IJWIN 2006»
13 years 7 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...
COCOON
2009
Springer
14 years 2 months ago
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
Ivona Bezáková, Nayantara Bhatnagar,...
FOCS
2002
IEEE
14 years 11 days ago
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, M...
TMC
2011
131views more  TMC 2011»
13 years 2 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—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...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
IFIPTM
2009
127views Management» more  IFIPTM 2009»
13 years 5 months ago
A Risk Based Approach to Limit the Effects of Covert Channels for Internet Sensor Data Aggregators for Sensor Privacy
Effective defense against Internet threats requires data on global real time network status. Internet sensor networks provide such real time network data. However, an organization...
Camilo H. Viecco, L. Jean Camp