1523 search results - page 22 / 305 » The Computational Complexity of Linear Optics |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
DAC
2009
ACM
14 years 8 months ago
2009
ACM
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
TWC
2008
13 years 7 months ago
2008
OFDMA resource allocation assigns subcarriers and power, and possibly data rates, to each user. Previous research efforts to optimize OFDMA resource allocation with respect to comm...