6437 search results - page 172 / 1288 » Parallel Algorithms for Arrangements |
111
click to vote
STOC
1999
ACM
15 years 7 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
ESA
2006
Springer
15 years 6 months ago
2006
Springer
132
click to vote
ICDE
2009
IEEE
15 years 18 days ago
2009
IEEE
With the advent of multicore processors, it has become imperative to write parallel programs if one wishes to exploit the next generation of processors. This paper deals with skyli...
117
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Parallel computation of the adaptive lattice filtering algorithm is difficult due to the dependency problem caused by feedback operations. The conventional control-level paralle...
124
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...