13603 search results - page 302 / 2721 » On the Computational Complexity of Cut-Reduction |
187
click to vote
GCC
2003
Springer
16 years 19 days ago
2003
Springer
Even though grid research is prosperous in an extensive context, few grid platforms for high performance computing are practical and in operation so far. Since most applications a...
204
click to vote
GD
1998
Springer
15 years 11 months ago
1998
Springer
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
187
click to vote
CASC
2006
Springer
15 years 11 months ago
2006
Springer
In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an "elementary simplicial perturbation" process such as th...