1390 search results - page 218 / 278 » On the Algebraic Structure of Convergence |
141
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...
168
click to vote
AMAI
2007
Springer
15 years 6 months ago
2007
Springer
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
188
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
182
click to vote
JCO
2008
15 years 6 months ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
150
click to vote
ENTCS
2007
15 years 6 months ago
2007
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...