21324 search results - page 3798 / 4265 » Making the case for computing |
123
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
147
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
192
click to vote
ISWC
1998
IEEE
15 years 9 months ago
1998
IEEE
system to date has served all of the needs of wearable computing--light weight, minimum effort, high power generation, convenient power delivery, and good power regulation. We beli...
143
click to vote
VISUALIZATION
1998
IEEE
15 years 9 months ago
1998
IEEE
Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A less studied problem is how to preserve on a simplified mesh the detail (e.g. co...
149
click to vote
SPAA
1998
ACM
15 years 9 months ago
1998
ACM
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...