3373 search results - page 617 / 675 » Linear transformations on codes |
150
click to vote
CGO
2003
IEEE
15 years 11 months ago
2003
IEEE
Dynamic optimization is emerging as a promising approach to overcome many of the obstacles of traditional static compilation. But while there are a number of compiler infrastructu...
148
click to vote
SPAA
2010
ACM
15 years 10 months ago
2010
ACM
In dynamically multithreaded platforms that employ work stealing, there appears to be a fundamental tradeoff between providing provably good time and space bounds and supporting S...
181
click to vote
LCPC
1998
Springer
15 years 10 months ago
1998
Springer
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
138
click to vote
PADS
1996
ACM
15 years 10 months ago
1996
ACM
One of the promises of parallelized discrete-event simulation is that it might provide significant speedups over sequential simulation. In reality, high performance cannot be achi...
163
click to vote
ICALP
1990
Springer
15 years 10 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...