254 search results - page 47 / 51 » On randomized one-round communication complexity |
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— The performance of wireless data systems has been thoroughly studied in the context of a single base station. In the present paper we analyze networks with several interacting ...
PODS
2010
ACM
14 years 21 days ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
INFOCOM
2000
IEEE
14 years 11 hour ago
2000
IEEE
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
FOCS
2007
IEEE
13 years 11 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...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...