1897 search results - page 359 / 380 » Sparse Additive Machine |
ICS
1999
Tsinghua U.
15 years 4 months ago
1999
Tsinghua U.
Current high-end parallel systems achieve low-latency, highbandwidth network communication through the use of aggressive design techniques and expensive mechanical and electrical ...
150
click to vote
CPM
1998
Springer
15 years 4 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
119
click to vote
FSTTCS
1998
Springer
15 years 4 months ago
1998
Springer
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
105
Voted
ISPAN
1997
IEEE
15 years 4 months ago
1997
IEEE
This paper is concerned with the transparent parallelisation of declarative database queries, based on theoretical principles. We have designed an entire database architecture sui...
PPOPP
1997
ACM
15 years 4 months ago
1997
ACM
Some of the most common parallel programming idioms include locks, barriers, and reduction operations. The interaction of these programming idioms with the multiprocessor's c...