524 search results - page 49 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
112
click to vote
CCCG
2008
15 years 1 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
IPL
2006
14 years 12 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— The paper deals with the problem of the carrier frequency-offset (CFO) estimation for wireless communications. Since the well-known maximum-likelihood (ML) CFO estimator is rat...