207 search results - page 21 / 42 » The Polynomial Method for Random Matrices |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
ICIP
2009
IEEE
13 years 6 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
BMCBI
2008
13 years 8 months ago
2008
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...