TIT
2002
13 years 11 months ago
2002
Sets of multivariable functions are described for which worst case errors in linear approximation are larger than those in approximation by neural networks. A theoretical framework...
TCS
2002
13 years 11 months ago
2002
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following:
SOFTWARE
2002
13 years 11 months ago
2002
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
TIP
1998
13 years 11 months ago
1998
Abstract—A general variational framework for image approximation and segmentation is introduced. By using a continuous “line-process” to represent edge boundaries, it is poss...
SIAMCOMP
1998
13 years 11 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
PE
1998
Springer
13 years 11 months ago
1998
Springer
Asymptotic approximations are constructed for the performance measures of product form queueing networks consisting of single server, fixed rate nodes with large populations. The...
MOC
1998
13 years 11 months ago
1998
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
COMGEO
1999
ACM
13 years 11 months ago
1999
ACM
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
COMGEO
1999
ACM
13 years 11 months ago
1999
ACM
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
MOR
2000
13 years 11 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...