817 search results - page 30 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
132
click to vote
STOC
1995
ACM
15 years 5 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
102
Voted
CCCG
2007
15 years 3 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
126
Voted
DAC
2004
ACM
15 years 5 months ago
2004
ACM
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
111
click to vote
ISCAS
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
120
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...