347 search results - page 60 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
179
click to vote
STOC
1993
ACM
15 years 3 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
104
click to vote
MVA
1990
15 years 27 days ago
1990
d at a high abstraction level, and consists in an expectation-driven search starting from symbolic object descriptions and using a version of a distributed blackboard system for re...
116
click to vote
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
Multiple-dimensional, i.e., polyadic, data exist in many applications, such as personalized recommendation and multipledimensional data summarization. Analyzing all the dimensions...
104
click to vote
PPSC
1993
15 years 1 months ago
1993
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
WMPI
2004
ACM
15 years 5 months ago
2004
ACM
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...