Sciweavers

CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 11 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
EDBT
2010
ACM
132views Database» more  EDBT 2010»
14 years 2 months ago
Turbo-charging hidden database samplers with overflowing queries and skew reduction
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
Arjun Dasgupta, Nan Zhang 0004, Gautam Das
DMSN
2004
ACM
14 years 4 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine