Sciweavers

10608 search results - page 202 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 4 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 11 months ago
Adversary lower bounds for nonadaptive quantum algorithms
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...
Pascal Koiran, Jürgen Landes, Natacha Portier...
JSAC
2008
94views more  JSAC 2008»
13 years 10 months ago
Soft-output sphere decoding: algorithms and VLSI implementation
Multiple-input multiple-output (MIMO) detection algorithms providing soft information for a subsequent channel decoder pose significant implementation challenges due to their high ...
Christoph Studer, Andreas Burg, Helmut Bölcsk...
ICALP
2007
Springer
14 years 5 months ago
Reconciling Data Compression and Kolmogorov Complexity
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...
Laurent Bienvenu, Wolfgang Merkle
VIS
2008
IEEE
134views Visualization» more  VIS 2008»
15 years 1 days ago
A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality
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...
Attila Gyulassy, Peer-Timo Bremer, Bernd Hamann,...