Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Matriz dispersa")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1749

  • Page / 70

Selection :

  • and

Simulated annealing for profile and fill reduction of sparse matricesLEWIS, R. R.International journal for numerical methods in engineering. 1994, Vol 37, Num 6, pp 905-925, issn 0029-5981Article

Simple sparse matrix multiplication algorithmKRAL, D; NOEGRADY, P; KELLÖ, V et al.Computer physics communications. 1995, Vol 85, Num 2, pp 213-216, issn 0010-4655Article

D-SAB: A Sparse matrix benchmark SuiteSTATHIS, Pyrrhos; VASSILIADIS, Stamatis; COTOFANA, Sorin et al.Lecture notes in computer science. 2003, pp 549-554, issn 0302-9743, isbn 3-540-40673-5, 6 p.Conference Paper

Sparse systems of parameters for determinantal varietiesGLASSBRENNER, D; SMITH, K. E.Advances in applied mathematics (Print). 1997, Vol 19, Num 4, pp 529-558, issn 0196-8858Article

A direct parallel sparse matrix solverTRAN, T. M; GRUBER, R; APPERT, K et al.Computer physics communications. 1996, Vol 96, Num 2-3, pp 118-128, issn 0010-4655Article

On point location and motion planning among simplicesPELLEGRINI, M.SIAM journal on computing (Print). 1996, Vol 25, Num 5, pp 1061-1081, issn 0097-5397Article

Applicability of program comprehension to sparse matrix computationsKESSLER, C. W.Lecture notes in computer science. 1997, pp 347-351, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Preprocessing issues in sparse matrix computationsAMESTOY, P. R; DAVIS, T. A; DUFF, I. S et al.Strategem '96. Symposium. 1996, pp 111-127, isbn 2-7261-0982-9Conference Paper

Sparse matrices in astronomical data reductionBRANHAM, R. L.The Astronomical journal (New York). 1992, Vol 104, Num 4, pp 1658-1661, issn 0004-6256Article

Evaluation of orderings for unsymmetric sparse matricesERISMAN, A. M; GRIMES, R. G; LEWIS, J. G et al.SIAM journal on scientific and statistical computing. 1987, Vol 8, Num 4, pp 600-624, issn 0196-5204Article

Input online review data and related bias in recommender systemsPIRAMUTHU, Selwyn; KAPOOR, Gaurav; WEI ZHOU et al.Decision support systems. 2012, Vol 53, Num 3, pp 418-424, issn 0167-9236, 7 p.Article

Spectral portrait for non-hermitian large sparse matricesCARPRAUX, J. F; ERHEL, J; SADKANE, M et al.Computing (Wien. Print). 1994, Vol 53, Num 3-4, pp 301-310, issn 0010-485XArticle

Vectorized sparse matrix multiply for compressed row storage formatD'AZEVEDO, Eduardo F; FAHEY, Mark R; MILLS, Richard T et al.Lecture notes in computer science. 2005, pp 99-106, issn 0302-9743, isbn 3-540-26032-3, 3Vol, 8 p.Conference Paper

A mapping and scheduling algorithm for parallel sparse fan-in numerical factorizationHENON, P; RAMET, P; ROMAN, J et al.Lecture notes in computer science. 1999, pp 1059-1067, issn 0302-9743, isbn 3-540-66443-2Conference Paper

The profile minimization problem in treesKUO, D; CHANG, G. J.SIAM journal on computing (Print). 1994, Vol 23, Num 1, pp 71-81, issn 0097-5397Article

A letter-oriented perfect hashing scheme based upon sparse table compressionCHIN-CHEN CHANG; TZONG-CHEN WU.Software, practice & experience. 1991, Vol 21, Num 1, pp 35-49, issn 0038-0644, 15 p.Article

On the effect of parity-check weights in iterative decodingSANTHI, Nandakishore; VARDY, Alexander.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 101Conference Paper

Minimizing the profile of a symmetric matrixHAGER, William W.SIAM journal on scientific computing (Print). 2002, Vol 23, Num 5, pp 1799-1816, issn 1064-8275Article

Scalable sparse matrix techniques for modeling crack growthRAGHAVAN, P; JAMES, M. A; NEWMAN, J. C et al.Lecture notes in computer science. 2002, pp 588-602, issn 0302-9743, isbn 3-540-43786-X, 15 p.Conference Paper

A technique for mapping sparse matrix computations into regular processor arraysWYRZYKOWSKI, R; KANEVSKI, J.Lecture notes in computer science. 1997, pp 310-317, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Implementation of a portable nested data-parallel languageBLELLOCH, G. E; HARDWICK, J. C; SIPELSTEIN, J et al.Journal of parallel and distributed computing (Print). 1994, Vol 21, Num 1, pp 4-14, issn 0743-7315Article

Use of sparse diagonal storage in finite element analysisYALAMANCHILI, K. K; ANAND, S. C.Computers & structures. 1993, Vol 46, Num 6, pp 963-967, issn 0045-7949Article

Massively parallel multifrontal methods for finite element analysis on MIMD computer systemsBENNER, R. E.SAE transactions. 1992, Vol 101, Num 6, pp 1202-1211, issn 0096-736XArticle

Efficient parallel processing technique for inverting matrices with random sparsityBETANCOURT, R.IEE proceedings. Part E. Computers and digital techniques. 1986, Vol 133E, Num 4, pp 235-240, issn 0143-7062Article

Parallel and fully recursive multifrontal supernodal sparse CholeskyIRONY, Dror; SHKLARSKI, Gil; TOLEDO, Sivan et al.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43591-3, 3Vol, vol. 2, 335-344Conference Paper

  • Page / 70