6568 search results - page 59 / 1314 » Reducing the Complexity of Reductions |
117
click to vote
ICIP
2003
IEEE
16 years 6 months ago
2003
IEEE
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
154
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— Clipping and filtering is an attractive method for the reduction of the PAPR of OFDM signals before transmission. However, the resulting in-band distortion noise impacts the e...
135
click to vote
TSP
2008
15 years 5 months ago
2008
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
180
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...
138
click to vote
LATIN
2010
Springer
15 years 12 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...