5762 search results - page 851 / 1153 » R-tree: A Hardware Implementation |
177
Voted
JSSPP
1997
Springer
15 years 11 months ago
1997
Springer
Large parallel processing environments present serious administrative challenges if high utilization of the available resources is a goal. In many cases there is also the need to ...
160
click to vote
SIGOPSE
1996
ACM
15 years 11 months ago
1996
ACM
We introduce server operating systems, which are sets of abstractions and runtime support for specialized, highperformance server applications. We have designed and are implementi...
189
click to vote
DAC
1994
ACM
15 years 11 months ago
1994
ACM
Existing software scheduling techniques limit the functions that can be implemented in software to those with a restricted class of timing constraints, in particular those with a c...
153
click to vote
FIWAC
1993
15 years 11 months ago
1993
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
179
click to vote
CIBCB
2007
IEEE
15 years 10 months ago
2007
IEEE
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...