6105 search results - page 818 / 1221 » A Parallel Algorithm for Bound-Smoothing |
184
click to vote
DGCI
1999
Springer
15 years 11 months ago
1999
Springer
Thinning of a binary object is an iterative layer by layer erosion to extract an approximation to its skeleton. In order to provide topology preservation, different thinning techn...
201
click to vote
ANSS
2007
IEEE
15 years 10 months ago
2007
IEEE
Molecular Dynamics (MD) involves solving Newton's equations of motion for a molecular system and propagating the system by time-dependent updates of atomic positions and velo...
159
click to vote
STOC
1987
ACM
15 years 10 months ago
1987
ACM
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
210
click to vote
ACSD
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
190
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...