1523 search results - page 34 / 305 » The Computational Complexity of Linear Optics |
HPCA
1995
IEEE
13 years 11 months ago
1995
IEEE
—Reducing communication latency, which is a performance bottleneck in optically interconnected multiprocessor systems, is of prominent importance. A conventional approach for est...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
A simple seed growing algorithm for estimating scene flow in a stereo setup is presented. Two calibrated and synchronized cameras observe a scene and output a sequence of image p...
CCECE
2006
IEEE
14 years 1 months ago
2006
IEEE
Blind modulation classification (MC) is an intermediate step between signal detection and demodulation, with both military and civilian applications. MC is a challenging task, esp...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...