266 search results - page 34 / 54 » On the variance of random polygons |
102
click to vote
LSSC
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...
103
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
TIT
2010
14 years 6 months ago
2010
Many recent works that study the performance of multi-input multi-output (MIMO) systems in practice assume a Kronecker model where the variances of the channel entries, upon decom...
98
Voted
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
We consider the task of under-determined reverberant audio source separation. We model the contribution of each source to all mixture channels in the time-frequency domain as a ze...
120
click to vote
SAC
2006
ACM
15 years 5 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...