Sciweavers

242 search results - page 4 / 49
» Approximately uniform random sampling in sensor networks
Sort
View
STACS
2005
Springer
13 years 11 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
INFOCOM
2007
IEEE
14 years 17 days ago
Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks
Abstract— We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing fi...
Zhenzhen Ye, Alhussein A. Abouzeid, Jing Ai
CP
2008
Springer
13 years 8 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
14 years 21 days ago
Region Sampling: Continuous Adaptive Sampling on Sensor Networks
Abstract— Satisfying energy constraints while meeting performance requirements is a primary concern when a sensor network is being deployed. Many recent proposed techniques offer...
Song Lin, Benjamin Arai, Dimitrios Gunopulos, Gaut...
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 6 months ago
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
Richard Beigel, Bin Fu