Sciweavers

10988 search results - page 192 / 2198
» Algorithmic Folding Complexity
Sort
View
124
Voted
CCECE
2006
IEEE
15 years 9 months ago
Likelihood-Based Algorithms for Linear Digital Modulation Classification in Fading Channels
Blind modulation classification (MC) is an intermediate step between signal detection and demodulation, with both military and civilian applications. MC is a challenging task, esp...
Octavia A. Dobre, Fahed Hameed
114
Voted
TSP
2011
141views more  TSP 2011»
14 years 10 months ago
Algorithms for Interpolation-Based QR Decomposition in MIMO-OFDM Systems
The extension of multiple-input multiple-output (MIMO) sphere decoding from the narrowband case to wideband systems based on orthogonal frequency division multiplexing (OFDM) requ...
Davide Cescato, Helmut Bölcskei
122
Voted
JBCB
2008
71views more  JBCB 2008»
15 years 3 months ago
Using Indirect protein-protein Interactions for protein Complex Prediction
Protein complexes are fundamental for understanding principles of cellular organizations. Accurate and fast protein complex prediction from the PPI networks of increasing sizes ca...
Hon Nian Chua, Kang Ning, Wing-Kin Sung, Hon Wai L...
138
Voted
FOCS
2003
IEEE
15 years 9 months ago
Polynomial Degree vs. Quantum Query Complexity
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
Andris Ambainis
130
Voted
LATIN
1998
Springer
15 years 7 months ago
Shape Reconstruction with Delaunay Complex
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
Herbert Edelsbrunner