817 search results - page 15 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
DAGSTUHL
2008
13 years 10 months ago
2008
Abstract. A parallel version of the self-verified method for solving linear systems was presented in [19, 18]. In this research we propose improvements aiming at a better performan...
MP
1998
13 years 8 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
DAC
2010
ACM
13 years 8 months ago
2010
ACM
We study diagnosis of segments on speedpaths that fail the timing constraint at the post-silicon stage due to manufacturing variations. We propose a formal procedure that is appli...
SODA
2000
ACM
13 years 10 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...