2354 search results - page 261 / 471 » Randomness, Stochasticity and Approximations |
166
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
161
Voted
WCE
2007
15 years 7 months ago
2007
— This paper presents an important outcome of a research programme which focuses on the development of a method for synthesizing, under controlled conditions in the laboratory, t...
129
click to vote
ICC
2007
IEEE
16 years 13 days ago
2007
IEEE
− During almost fifty years the Fade Duration Distribution (FDD) of random signals has been an open research topic. However, for Nakagami fading channels, and in general for the ...
206
click to vote
PCI
2001
Springer
15 years 10 months ago
2001
Springer
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
148
click to vote
PR
2008
15 years 6 months ago
2008
We describe Nonnegative Double Singular Value Decomposition (NNDSVD), a new method designed to enhance the initialization stage of nonnegative matrix factorization (NMF). NNDSVD c...