6045 search results - page 293 / 1209 » Computable Linearizations of Well-partial-orderings |
203
click to vote
COMPGEOM
2001
ACM
15 years 11 months ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
185
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
In [12] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be...
197
click to vote
PC
2008
15 years 7 months ago
2008
Traditional large sparse linear solvers are not suited in a grid computing environment as they require a large amount of synchronization and communication penalizing the performan...
202
click to vote
PVM
1997
Springer
15 years 11 months ago
1997
Springer
The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to proc...
208
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...