1091 search results - page 47 / 219 » Approximation Algorithms for Data Placement Problems |
ESANN
2000
13 years 9 months ago
2000
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...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
CCCG
1998
13 years 9 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...