Sciweavers

1649 search results - page 292 / 330
» Improved Matrix Interpretation
Sort
View
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
15 years 5 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
WABI
2009
Springer
117views Bioinformatics» more  WABI 2009»
15 years 5 months ago
A Simulation Study Comparing Supertree and Combined Analysis Methods Using SMIDGen
Background: Supertree methods comprise one approach to reconstructing large molecular phylogenies given multi-marker datasets: trees are estimated on each marker and then combined...
M. Shel Swenson, François Barbançon,...
CIKM
2009
Springer
15 years 5 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan
GLOBECOM
2008
IEEE
15 years 5 months ago
Distributed Base Station Cooperation via Block-Diagonalization and Dual-Decomposition
Abstract—It has been recently shown that base station cooperation may yield great capacity improvement in downlink multiple antenna cellular networks. However, the proposed solut...
Yosia Hadisusanto, Lars Thiele, Volker Jungnickel
PIMRC
2008
IEEE
15 years 5 months ago
Joint turbo channel estimation and data recovery in fast fading mobile coded OFDM
Orthogonal frequency division multiplexing (OFDM) system suffers extra performance degradation in fast fading channel due to intercarrier interference (ICI). Combing frequency dom...
Daniel N. Liu, Michael P. Fitz