3341 search results - page 125 / 669 » On Bounded Queries and Approximation |
176
click to vote
AAECC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
153
click to vote
WADS
2009
Springer
16 years 5 days ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
175
click to vote
COLOGNETWENTE
2007
15 years 7 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
130
click to vote
WSC
2004
15 years 7 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
262
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...