1515 search results - page 47 / 303 » Parallel computing on any desktop |
107
Voted
ICPP
1998
IEEE
15 years 5 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
134
click to vote
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper presents a new approach to improve performance of Java programs by extending the superthreaded speculative execution model [14, 15] to exploit coarsegrained parallelism...
109
click to vote
CSR
2008
Springer
15 years 3 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
103
click to vote
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
266
Voted
ICDE
2000
IEEE
16 years 2 months ago
2000
IEEE
This paper presents an overview of Microsoft SQLServer for Windows CE. This is a database engine designed for mobile and embedded applications. The focus of the presentation is on...