507 search results - page 48 / 102 » Computing Sparse Multiples of Polynomials |
NIPS
2008
13 years 9 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
13 years 7 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...
ICCV
2009
IEEE
15 years 23 days 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....
BMCBI
2007
13 years 8 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...
EUROCRYPT
2000
Springer
13 years 11 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...