Sciweavers

2239 search results - page 61 / 448
» Computing with abstract matrix structures
Sort
View
EUROPAR
2005
Springer
15 years 5 months ago
Automatic Tuning of PDGEMM Towards Optimal Performance
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
Sascha Hunold, Thomas Rauber
ICCAD
1993
IEEE
121views Hardware» more  ICCAD 1993»
15 years 4 months ago
Hierarchical extraction of 3D interconnect capacitances in large regular VLSI structures
For submicron integrated circuits, 3D numerical techniques are required to accurately compute the values of the interconnect capacitances. In this paper, we describe an hierarchic...
Arjan J. van Genderen, N. P. van der Meijs
CORR
2006
Springer
69views Education» more  CORR 2006»
14 years 12 months ago
Bounds on the coefficients of the characteristic and minimal polynomials
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
Jean-Guillaume Dumas
CLIN
2000
15 years 1 months ago
Alpino: Wide-coverage Computational Analysis of Dutch
Alpino is a wide-coverage computational analyzer of Dutch which aims at accurate, full, parsing of unrestricted text. We describe the head-driven lexicalized grammar and the lexic...
Gosse Bouma, Gertjan van Noord, Rob Malouf
EJC
2008
14 years 12 months ago
Locally constrained graph homomorphisms and equitable partitions
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
Jirí Fiala, Daniël Paulusma, Jan Arne ...