Sciweavers

10988 search results - page 226 / 2198
» Algorithmic Folding Complexity
Sort
View
TSP
2008
94views more  TSP 2008»
15 years 3 months ago
Cross-Entropy-Based Sign-Selection Algorithms for Peak-to-Average Power Ratio Reduction of OFDM Systems
Sign-selection uses a set of subcarrier signs to reduce the peak-to-average power ratio (PAR) of orthogonal-frequency-division multiplexing (OFDM). However, the computational compl...
Luqing Wang, Chintha Tellambura
ICC
2007
IEEE
15 years 10 months ago
Low-Complexity EM-based Joint CFO and IQ imbalance Acquisition
—New air interfaces are currently being developed to meet the high spectral efficiency requirements of the emerging wireless communication systems. In this context, OFDM is cons...
François Horlin, André Bourdoux, Edu...
COMPGEOM
2003
ACM
15 years 9 months ago
Molecular shape analysis based upon the morse-smale complex and the connolly function
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
Frédéric Cazals, Frédé...
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
15 years 5 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
15 years 9 months ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag