8917 search results - page 336 / 1784 » Abstraction in Algorithm Animation |
118
click to vote
ICCSA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
132
click to vote
PVM
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
138
click to vote
FCT
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
121
Voted
ICCS
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. One of the main challenges of grid systems of large scale and data intensive is that of providing high availability and performance, in spite of the unreliability and del...
140
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...