6568 search results - page 49 / 1314 » Reducing the Complexity of Reductions |
VLSID
2007
IEEE
16 years 7 days ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
111
click to vote
ICS
2001
Tsinghua U.
15 years 4 months ago
2001
Tsinghua U.
The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs th...
CNSR
2008
IEEE
15 years 6 months ago
2008
IEEE
Localizing tiny sensor nodes in large wireless sensor networks is extremely complex, due to the node’s strict resource limitations regarding memory size, processor performance a...
106
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of...