10988 search results - page 268 / 2198 » Algorithmic Folding Complexity |
131
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
142
Voted
JSAC
2008
15 years 4 months ago
2008
Multiple-input multiple-output (MIMO) detection algorithms providing soft information for a subsequent channel decoder pose significant implementation challenges due to their high ...
142
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
155
click to vote
VIS
2008
IEEE
16 years 5 months ago
2008
IEEE
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for lar...
131
click to vote
ASAP
2007
IEEE
15 years 10 months ago
2007
IEEE
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...