Sciweavers

242 search results - page 12 / 49
» Approximately uniform random sampling in sensor networks
Sort
View
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 7 months ago
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
Alin Dobra
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
14 years 27 days ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
SASN
2004
ACM
14 years 25 days ago
Location-aware key management scheme for wireless sensor networks
Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Recently, several...
Dijiang Huang, Manish Mehta 0003, Deep Medhi, Lein...
ISCIS
2004
Springer
14 years 23 days ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
TOCS
2008
107views more  TOCS 2008»
13 years 7 months ago
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...
Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot