524 search results - page 36 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
LICS
1997
IEEE
13 years 12 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
IOR
2011
13 years 2 months ago
2011
We consider a pricing problem in an environment where the customers’ willingness-to-pay (WtP) distribution may change at some point over the selling horizon. Customers arrive se...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Orthogonal frequency division multiplexing (OFDM) communication systems require accurate estimation of timing offset and channel impulse response in order to achieve desirable per...