Sciweavers

13603 search results - page 170 / 2721
» On the Complexity of Computing Treelength
Sort
View
CVPR
2007
IEEE
16 years 6 months ago
Artificial Complex Cells via the Tropical Semiring
The seminal work of Hubel and Wiesel [14] and the vast amount of work that followed it prove that hierarchies of increasingly complex cells play a central role in cortical computa...
Lior Wolf, Moshe Guttmann
CVPR
2008
IEEE
16 years 6 months ago
Modeling complex luminance variations for target tracking
Lambert's model is widely used in low level computer vision algorithms such as matching, tracking or optical flow computation for example. However, it is well known that thes...
Éric Marchand, Christophe Collewet
TSP
2011
141views more  TSP 2011»
14 years 11 months ago
Algorithms for Interpolation-Based QR Decomposition in MIMO-OFDM Systems
The extension of multiple-input multiple-output (MIMO) sphere decoding from the narrowband case to wideband systems based on orthogonal frequency division multiplexing (OFDM) requ...
Davide Cescato, Helmut Bölcskei
ICASSP
2011
IEEE
14 years 8 months ago
Latency-constrained low-complexity lattice reduction for MIMO-OFDM systems
Recent studies have investigated lattice-reduction (LR) preprocessing technique for multiple-inputmultiple-output (MIMO) detection. However, if LR is applied to the orthogonalfreq...
Chun-Fu Liao, Fang-Chun Lan, Yuan-Hao Huang, Po-Li...
CIE
2007
Springer
15 years 10 months ago
Circuit Complexity of Regular Languages
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...
Michal Koucký