501 search results - page 27 / 101 » Communication Lower Bounds Using Dual Polynomials |
PODS
2004
ACM
14 years 9 months ago
2004
ACM
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
ICC
2009
IEEE
14 years 3 months ago
2009
IEEE
—In this paper, we investigate the effects of imperfect knowledge of the channel covariance matrix on the performance of a linear minimum mean-square-error (MMSE) estimator for m...
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...