1957 search results - page 2 / 392 » Approximate algorithms for neural-Bayesian approaches |
SODA
2001
ACM
13 years 7 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
AI
2005
Springer
13 years 5 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
STOC
2000
ACM
13 years 9 months ago
2000
ACM
COMPGEOM
2001
ACM
13 years 9 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
NIPS
2003
13 years 7 months ago
2003
The maximisation of information transmission over noisy channels is a common, albeit generally computationally difficult problem. We approach the difficulty of computing the mutua...