113 search results - page 6 / 23 » Simpler is also better in approximating fixed points |
HYBRID
2010
Springer
15 years 4 months ago
2010
Springer
This paper is concerned with reachable set computation for non-linear systems using hybridization. The essence of hybridization is to approximate a non-linear vector field by a s...
SODA
1992
ACM
14 years 10 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
RECOMB
2006
Springer
15 years 9 months ago
2006
Springer
Micro-indels are small insertion or deletion events (indels) that occur during genome evolution. The study of micro-indels is important, both in order to better understand the unde...
JAT
2010
14 years 4 months ago
2010
For r 3, n N and each 3-monotone continuous function f on [a, b] (i.e., f is such that its third divided differences [x0, x1, x2, x3] f are nonnegative for all choices of distin...