Sciweavers

13603 search results - page 155 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
IPL
2006
104views more  IPL 2006»
15 years 6 months ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
TSP
2008
117views more  TSP 2008»
15 years 6 months ago
Asymptotically Efficient Reduced Complexity Frequency Offset and Channel Estimators for Uplink MIMO-OFDMA Systems
In this paper, we address the joint data-aided estimation of frequency offsets and channel coefficients in uplink MIMO-OFDMA systems. As the Maximum Likelihood (ML) estimator is i...
Serdar Sezginer, Pascal Bianchi
IJCV
2000
110views more  IJCV 2000»
15 years 6 months ago
A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
Javier Portilla, Eero P. Simoncelli
160
Voted
RAS
2008
109views more  RAS 2008»
15 years 5 months ago
When hard realtime matters: Software for complex mechatronic systems
A still growing number of software concepts and framworks have been proposed to meet the challenges in the development of more and more complex robotic systems, like humanoids or n...
Berthold Bäuml, Gerd Hirzinger
LOGCOM
2010
96views more  LOGCOM 2010»
15 years 4 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis