Sciweavers

11151 search results - page 2 / 2231
» On the Complexity of Model Expansion
Sort
View
ICC
2007
IEEE
303views Communications» more  ICC 2007»
13 years 11 months ago
Frequency Domain Channel Estimation for OFDM Based on Slepian Basis Expansion
Abstract—In this paper we propose a low complexity frequency domain channel estimator for pilot-symbol-assisted (PSA) orthogonal frequency division multiplexing (OFDM) systems in...
Jinho Kim, Chih-Wei Wang, Wayne E. Stark
ICC
2007
IEEE
197views Communications» more  ICC 2007»
13 years 11 months ago
Basis Expansion Model and Doppler Diversity Techniques for Frequency Domain Channel Estimation and Equalization in DS-CDMA Syste
Abstract— In this paper, we propose a frequency domain adaptive estimation of Doppler shifts for multiple Doppler subpaths in direct sequence code division multiple access (DS-CD...
Tianqi Wang, Cheng Li, Hsiao-Hwa Chen
PE
2010
Springer
170views Optimization» more  PE 2010»
13 years 3 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
CORR
2010
Springer
202views Education» more  CORR 2010»
13 years 5 months ago
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
Nadia Creignou, Arne Meier, Michael Thomas, Heribe...
TOG
2002
127views more  TOG 2002»
13 years 4 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers