13603 search results - page 127 / 2721 » On the Computational Complexity of Cut-Reduction |
191
click to vote
ACRI
2010
Springer
15 years 5 months ago
2010
Springer
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
178
Voted
ECCV
1998
Springer
15 years 10 months ago
1998
Springer
This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of e...
165
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
169
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: In a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUS...
170
click to vote
SAS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...