Sciweavers

6568 search results - page 119 / 1314
» Reducing the Complexity of Reductions
Sort
View
TSP
2008
151views more  TSP 2008»
15 years 6 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
VTC
2006
IEEE
16 years 14 days ago
Reduction of Amplitude Clipping Level with OFDM/TDM
—The OFDM signals have a problem of high peak-to-average power ratio (PAPR). Hence, a large transmit-power backoff or amplitude clipping is required. The amplitude clipping cause...
Haris Gacanin, Shinsuke Takaoka, Fumiyuki Adachi
ISLPED
1997
ACM
116views Hardware» more  ISLPED 1997»
15 years 10 months ago
Power reduction techniques for a spread spectrum based correlator
This paper presents the design of a low power spread spectrum correlator. We look at two major approaches and evaluate the best alternative for power reduction. We first consider...
David Garrett, Mircea R. Stan
ENGL
2008
79views more  ENGL 2008»
15 years 6 months ago
Cost Reduction in Nearest Neighbour Based Synthesis of Quantum Boolean Circuits
Quantum computer algorithms require an `oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and ...
Mozammel H. A. Khan
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
15 years 7 months ago
Nonlinear Dimensionality Reduction using Approximate Nearest Neighbors
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
Erion Plaku, Lydia E. Kavraki