Sciweavers

15033 search results - page 417 / 3007
» Complexity Theory and Algorithms
Sort
View
TSP
2011
141views more  TSP 2011»
15 years 2 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
JBCB
2008
71views more  JBCB 2008»
15 years 7 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...
FOCS
2003
IEEE
16 years 29 days 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
LATIN
1998
Springer
15 years 12 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
LATIN
2010
Springer
15 years 9 months ago
Complexity of Operations on Cofinite Languages
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
Frédérique Bassino, Laura Giambruno,...