1974 search results - page 94 / 395 » On Unbiased Linear Approximations |
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
85
Voted
AAAI
2008
15 years 3 months ago
2008
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
97
Voted
NN
2010
Springer
14 years 7 months ago
2010
Springer
We investigate the linear stability of a neural network with distributed delay, where the neurons are identical. We examine the stability of a symmetrical equilibrium point via th...
90
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We provide a general framework for learning precise, compact, and fast representations of the Bayesian predictive distribution for a model. This framework is based on minimizing t...