180 search results - page 2 / 36 » Fast and Near-Optimal Algorithms for Approximating Distribut... |
FOCS
2005
IEEE
13 years 11 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
PODS
2002
ACM
14 years 5 months ago
2002
ACM
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
MOBIHOC
2010
ACM
13 years 3 months ago
2010
ACM
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
EDBT
2011
ACM
12 years 9 months ago
2011
ACM
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...