1429 search results - page 42 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
ICCS
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
NIPS
2004
13 years 9 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
DAC
1996
ACM
13 years 11 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
JMLR
2010
13 years 2 months ago
2010
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...
CDC
2009
IEEE
14 years 9 days ago
2009
IEEE
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...