885 search results - page 66 / 177 » Random Matrices in Data Analysis |
COCOON
2001
Springer
14 years 8 days ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
TIT
2010
13 years 2 months ago
2010
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an ex...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...
SPAA
2010
ACM
13 years 8 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The first part of our work is connected with the analysis of typical random variables for the specific human-initiated process. We study the data characterizing editorial work wit...