412 search results - page 44 / 83 » Diagonalization |
GD
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cub...
IPPS
1997
IEEE
15 years 2 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
ANNPR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In our previous work we have shown that Mahalanobis kernels are useful for support vector classifiers both from generalization ability and model selection speed. In this ...
CIARP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. A theoretical analysis for comparing two linear dimensionality reduction (LDR) techniques, namely Fisher's discriminant (FD) and Loog-Duin (LD) dimensionality reduci...
104
click to vote
STACS
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...