Sciweavers

8669 search results - page 150 / 1734
» Computing matrix representations
Sort
View
ISQED
2008
IEEE
153views Hardware» more  ISQED 2008»
14 years 3 months ago
Accelerating Clock Mesh Simulation Using Matrix-Level Macromodels and Dynamic Time Step Rounding
Clock meshes have found increasingly wide applications in today’s high-performance IC designs. The inherent routing redundancies associated with clock meshes lead to improved cl...
Xiaoji Ye, Min Zhao, Rajendran Panda, Peng Li, Jia...
HPCN
1997
Springer
14 years 1 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher
BMCBI
2010
201views more  BMCBI 2010»
13 years 9 months ago
Analysis of X-ray Structures of Matrix Metalloproteinases via Chaotic Map Clustering
Background: Matrix metalloproteinases (MMPs) are well-known biological targets implicated in tumour progression, homeostatic regulation, innate immunity, impaired delivery of pro-...
Ilenia Giangreco, Orazio Nicolotti, Angelo Carotti...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 9 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
JSC
2008
126views more  JSC 2008»
13 years 7 months ago
Computing singular points of plane rational curves
We compute the singular points of a plane rational curve, parametrically given, using the implicitization matrix derived from the -basis of the curve. It is shown that singularity...
Falai Chen, Wenping Wang, Yang Liu