6568 search results - page 356 / 1314 » Reducing the Complexity of Reductions |
184
click to vote
ISCAS
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a n...
238
Voted
VTC
2010
IEEE
15 years 5 months ago
2010
IEEE
Existing high-rate full diversity space-time codes (STC) always have high decoding complexity with traditional ML (maximum-likelihood) or near-ML decoding. Hence the decoding schem...
221
click to vote
JFP
2000
15 years 7 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
218
click to vote
BMVC
2010
15 years 5 months ago
2010
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
222
click to vote
CRYPTO
2011
Springer
14 years 7 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...