Sciweavers

12519 search results - page 148 / 2504
» Approximation Problems Categories
Sort
View
WSC
2008
15 years 8 months ago
On the approximation error in high dimensional model representation
Mathematical models are often described by multivariate functions, which are usually approximated by a sum of lower dimensional functions. A major problem is the approximation err...
Xiaoqun Wang
SODA
2000
ACM
125views Algorithms» more  SODA 2000»
15 years 7 months ago
Approximation algorithms for projective clustering
We consider the following two instances of the projective clustering problem: Given a set
Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 8 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
ARITH
2007
IEEE
16 years 22 days ago
Floating-point L2-approximations to functions
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
Nicolas Brisebarre, Guillaume Hanrot
KDD
2009
ACM
298views Data Mining» more  KDD 2009»
16 years 1 months ago
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
Rong Pan, Martin Scholz