3341 search results - page 224 / 669 » On Bounded Queries and Approximation |
141
click to vote
AAECC
1995
Springer
15 years 10 months ago
1995
Springer
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...
170
click to vote
IPL
2008
15 years 6 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
143
click to vote
JCSS
2008
15 years 6 months ago
2008
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
147
click to vote
ITA
2007
15 years 6 months ago
2007
We explicit the link between the computer arithmetic problem of providing correctly rounded algebraic functions and some diophantine approximation issues. This allows to get bounds...
156
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...