4894 search results - page 251 / 979 » The Guarding Problem - Complexity and Approximation |
147
click to vote
ESANN
2006
15 years 8 months ago
2006
In this paper, the problem of an optimal transformation of the input space for function approximation problems is addressed. The transformation is defined determining the Mahalanob...
159
click to vote
ESANN
2003
15 years 8 months ago
2003
- In this paper we investigate mixture of experts problems in the context of Local-Global Neural Networks. This type of architecture was originaly conceived for functional approxim...
160
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
165
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
210
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...