388 search results - page 60 / 78 » Robust Lower Bounds for Communication and Stream Computation |
269
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
146
click to vote
MOBIHOC
2006
ACM
16 years 5 months ago
2006
ACM
Existing multi-channel protocols have been demonstrated to significantly increase aggregate throughput compared to single-channel protocols. However, we show that despite such imp...
184
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
160
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
137
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...