Sciweavers

1957 search results - page 7 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ICCS
2003
Springer
15 years 2 months ago
Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
Ana Paula Tomás, António Leslie Baju...
ICIP
2009
IEEE
15 years 10 months ago
A Graph-cut Based Algorithm For Approximate Mrf Optimization
This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and move making techniques...
AI
2011
Springer
14 years 4 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
NIPS
2004
14 years 11 months ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
ESANN
2000
14 years 11 months ago
A neural network approach to adaptive pattern analysis - the deformable feature map
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
Axel Wismüller, Frank Vietze, Dominik R. Ders...