1957 search results - page 1 / 392 » Approximate algorithms for neural-Bayesian approaches |
TCS
2002
13 years 4 months ago
2002
JUCS
2007
13 years 4 months ago
2007
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
IJCAI
2001
13 years 6 months ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
ICA
2004
Springer
13 years 10 months ago
2004
Springer
We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, comple...