3690 search results - page 54 / 738 » Computation with classical sequents |
120
click to vote
COMPGEOM
1999
ACM
15 years 2 months ago
1999
ACM
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical ...
AAIM
2007
Springer
15 years 1 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...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
IJBC
2007
14 years 9 months ago
2007
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...
AMC
2004
14 years 9 months ago
2004
An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, ...