2040 search results - page 131 / 408 » Approximate Expectation Maximization |
109
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
138
click to vote
DSMML
2004
Springer
15 years 8 months ago
2004
Springer
Learning curves for Gaussian process (GP) regression can be strongly affected by a mismatch between the ‘student’ model and the ‘teacher’ (true data generation process), e...
114
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
179
click to vote
WINE
2010
Springer
15 years 1 months ago
2010
Springer
The problem of influence maximization deals with choosing the optimal set of nodes in a social network so as to maximize the resulting spread of a technology (opinion, productowne...
128
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...