3341 search results - page 105 / 669 » On Bounded Queries and Approximation |
CASC
2009
Springer
15 years 4 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
WAOA
2007
Springer
15 years 4 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
AUTOMATICA
2006
14 years 10 months ago
2006
A robust MPC for constrained nonlinear systems with uncertainties is presented. Outer bounds of the reachable sets of the system are used to predict the evolution of the system un...
CAD
2006
Springer
14 years 10 months ago
2006
Springer
Fat arcs form bounding boxes for planar curves. An example on approximation by fat arcs, provided by Qun and Rokne, is corrected. The third derivative of the given curve segment u...
174
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...