507 search results - page 48 / 102 » Computing Sparse Multiples of Polynomials |
136
click to vote
NIPS
2008
15 years 3 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
107
click to vote
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
Our objective is to obtain a state-of-the art object category
detector by employing a state-of-the-art image classifier
to search for the object in all possible image subwindows....
114
Voted
BMCBI
2007
15 years 2 months ago
2007
Background: Although testing for simultaneous divergence (vicariance) across different population-pairs that span the same barrier to gene flow is of central importance to evoluti...
149
click to vote
EUROCRYPT
2000
Springer
15 years 6 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...