Sciweavers

4277 search results - page 6 / 856
» On Multiple Linear Approximations
Sort
View
MOC
1998
73views more  MOC 1998»
14 years 9 months ago
Detecting perfect powers in essentially linear time
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect ...
Daniel J. Bernstein
NIPS
2008
14 years 11 months ago
Multi-label Multiple Kernel Learning
We present a multi-label multiple kernel learning (MKL) formulation in which the data are embedded into a low-dimensional space directed by the instancelabel correlations encoded ...
Shuiwang Ji, Liang Sun, Rong Jin, Jieping Ye
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
15 years 4 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
CORR
2008
Springer
83views Education» more  CORR 2008»
14 years 10 months ago
Resource Allocation in Multiple Access Channels
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...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
ECML
2007
Springer
15 years 4 months ago
Bayesian Inference for Sparse Generalized Linear Models
We present a framework for efficient, accurate approximate Bayesian inference in generalized linear models (GLMs), based on the expectation propagation (EP) technique. The paramete...
Matthias Seeger, Sebastian Gerwinn, Matthias Bethg...