13603 search results - page 318 / 2721 » On the Computational Complexity of Cut-Reduction |
173
click to vote
TSP
2011
15 years 2 months ago
2011
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...
184
Voted
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
Recent studies have investigated lattice-reduction (LR) preprocessing technique for multiple-inputmultiple-output (MIMO) detection. However, if LR is applied to the orthogonalfreq...
180
click to vote
CIE
2007
Springer
16 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...
188
Voted
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
16 years 2 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
201
Voted
CIE
2009
Springer
16 years 2 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...