Sciweavers

1434 search results - page 130 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
CORR
2008
Springer
119views Education» more  CORR 2008»
15 years 2 months ago
BER and Outage Probability Approximations for LMMSE Detectors on Correlated MIMO Channels
This paper is devoted to the study of the performance of the linear minimum mean-square error (LMMSE) receiver for (receive) correlated multiple-input multiple-output (MIMO) system...
Abla Kammoun, Malika Kharouf, Walid Hachem, Jamal ...
CSDA
2006
82views more  CSDA 2006»
15 years 2 months ago
Nearest neighbours in least-squares data imputation algorithms with different missing patterns
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
Ito Wasito, Boris Mirkin
102
Voted
IPPS
1993
IEEE
15 years 6 months ago
Supporting Insertions and Deletions in Striped Parallel Filesystems
The dramatic improvements in the processing rates of parallel computers are turning many compute-bound jobs into IO-bound jobs. Parallel le systems have been proposed to better ma...
Theodore Johnson
TOMACS
2011
139views more  TOMACS 2011»
14 years 9 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
CPC
2004
76views more  CPC 2004»
15 years 2 months ago
On Some Parameters in Heap Ordered Trees
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
Kate Morris, Alois Panholzer, Helmut Prodinger