Sciweavers

2040 search results - page 35 / 408
» On the Complexity of Error Explanation
Sort
View
VTC
2006
IEEE
104views Communications» more  VTC 2006»
14 years 3 months ago
Low-Complexity Optimal Detection for Hybrid Space-Time Block Coding and Spatial Multiplexing
— The combination of space-time block codes (STBC) and spatial multiplexing (SM) schemes has the advantages of diversity gain and high data rate. For such STBC/SM hybrid systems,...
Yue Wu, Chintha Tellambura
GLOBECOM
2008
IEEE
13 years 10 months ago
Towards the Performance of ML and the Complexity of MMSE - A Hybrid Approach
—In this paper, we present a near ML-achieving sphere search technique that reduces the number of search operations significantly over existing sphere decoding (SD) algorithms. ...
Byonghyo Shim, Jun Won Choi, Insung Kang
JUCS
2008
151views more  JUCS 2008»
13 years 9 months ago
The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted Integration
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
Volker Bosserhoff
ICMCS
2006
IEEE
119views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Optimal Error Protection of Progressively Compressed 3D Meshes
Given a number of available layers of source data and a transmission bit budget, we propose an algorithm that determines how many layers should be sent and how many protection bit...
Shakeel Ahmad, Raouf Hamzaoui
JC
2008
96views more  JC 2008»
13 years 9 months ago
Adaptivity and computational complexity in the numerical solution of ODEs
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
Silvana Ilie, Gustaf Söderlind, Robert M. Cor...