DAGSTUHL
2004
13 years 6 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
CCCG
2006
13 years 6 months ago
2006
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
DAGSTUHL
2008
13 years 6 months ago
2008
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
AIMSA
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first stated in
WSC
2008
13 years 7 months ago
2008
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...
AAAI
2008
13 years 7 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
AAAI
2008
13 years 7 months ago
2008
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first
SAS
2000
Springer
13 years 8 months ago
2000
Springer
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...