4843 search results - page 86 / 969 » The Shortcut Problem - Complexity and Approximation |
144
click to vote
WWW
2009
ACM
16 years 3 months ago
2009
ACM
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
102
click to vote
WSC
2008
15 years 5 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...
105
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
We consider the following two instances of the projective clustering problem: Given a set
143
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
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...
ARITH
2007
IEEE
15 years 9 months ago
2007
IEEE
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....