Sciweavers

3454 search results - page 361 / 691
» Modern computer algebra
Sort
View
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
16 years 4 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan
ISSAC
1995
Springer
155views Mathematics» more  ISSAC 1995»
15 years 10 months ago
On the Implementation of Dynamic Evaluation
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...
Peter A. Broadbery, T. Gómez-Díaz, S...
CORR
2008
Springer
190views Education» more  CORR 2008»
15 years 5 months ago
Chain-Based Representations for Solid and Physical Modeling
In this paper we show that the (co)chain complex associated with a decomposition of the computational domain, commonly called a mesh in computational science and engineering, can b...
Antonio DiCarlo, Franco Milicchio, Alberto Paoluzz...
HPCA
2005
IEEE
16 years 7 months ago
Scatter-Add in Data Parallel Architectures
Many important applications exhibit large amounts of data parallelism, and modern computer systems are designed to take advantage of it. While much of the computation in the multi...
Jung Ho Ahn, Mattan Erez, William J. Dally
AINA
2009
IEEE
16 years 1 months ago
Predictive Simulation of HPC Applications
The architectures which support modern supercomputing machinery are as diverse today, as at any point during the last twenty years. The variety of processor core arrangements, thr...
Simon D. Hammond, J. A. Smith, Gihan R. Mudalige, ...