8917 search results - page 180 / 1784 » Abstraction in Algorithm Animation |
170
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
171
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
158
click to vote
ASIACRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...
133
click to vote
MPC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
164
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...