5115 search results - page 314 / 1023 » On Randomized Lanczos Algorithms |
158
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Let X be a discrete random variable with support S and f : S S be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preserva...
241
click to vote
IDA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
201
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
It has recently been shown that only a small number of samples from a low-rank matrix are necessary to reconstruct the entire matrix. We bring this to bear on computer vision prob...
169
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
186
click to vote
WAW
2009
Springer
16 years 1 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...