6105 search results - page 37 / 1221 » A Parallel Algorithm for Bound-Smoothing |
SPAA
1993
ACM
14 years 17 days ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
EGPGV
2011
Springer
13 years 18 hour ago
2011
Springer
We present parallel algorithms for processing, extracting and rendering adaptively sampled regular terrain datasets represented as a multiresolution model defined by a super-squa...
PRL
1998
13 years 8 months ago
1998
Thinning is a frequently used method for extracting skeletons in discrete spaces. This paper presents an efficient parallel Žthinning algorithm that directly extracts medial line...
PPSN
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
IPL
2002
13 years 8 months ago
2002
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...