6568 search results - page 57 / 1314 » Reducing the Complexity of Reductions |
133
click to vote
ICCAD
2004
IEEE
16 years 2 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
148
click to vote
DATE
2009
IEEE
15 years 12 months ago
2009
IEEE
—This paper presents a novel VLSI implementation of a MIMO detector for OFDM systems. The proposed architecture is able to perform both linear MMSE and reduced latticeaided MIMO ...
137
click to vote
STACS
2000
Springer
15 years 8 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...
159
click to vote
RTSS
2000
IEEE
15 years 8 months ago
2000
IEEE
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...
167
click to vote
SLIP
2003
ACM
15 years 10 months ago
2003
ACM
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...