1813 search results - page 57 / 363 » Calculi of Approximation Spaces |
132
click to vote
SIAMNUM
2010
15 years 28 days ago
2010
Hyperbolic cross approximations by some classical orthogonal polynomials/functions in both bounded and unbounded domains are considered in this paper. Optimal error estimates in pr...
185
click to vote
CGF
2008
15 years 6 months ago
2008
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
163
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
263
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
186
click to vote
STACS
2007
Springer
16 years 9 days ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...