3454 search results - page 97 / 691 » Modern computer algebra |
151
Voted
PPAM
2007
Springer
16 years 8 days ago
2007
Springer
Dense linear algebra codes are often expressed and coded in terms of BLAS calls. This approach, however, achieves suboptimal performance due to the overheads associated to such cal...
153
Voted
FCT
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents a method for the decomposition of HML formulae. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms s...
156
click to vote
CCCG
2010
15 years 7 months ago
2010
We analyze degeneracy of lower envelopes of algebraic surfaces. We focus on the cases omitted in the existing complexity analysis of lower envelopes [Halperin and Sharir 1993], an...
156
click to vote
ACS
2011
15 years 1 months ago
2011
Using the parallel between the preframe and the suplattice approach to locale theory it is shown that the patch construction, as an action on topologies, is the same thing as the ...
155
click to vote
PPOPP
2012
ACM
14 years 1 months ago
2012
ACM
The efforts of an expert to parallelize and optimize a dense linear algebra algorithm for distributed-memory targets are largely mechanical and repetitive. We demonstrate that the...