Sciweavers

20066 search results - page 3768 / 4014
» T Spaces
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
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....
Sven Venema, Hong Shen, Francis Suraweera
MICRO
1998
IEEE
144views Hardware» more  MICRO 1998»
15 years 11 months ago
Analyzing the Working Set Characteristics of Branch Execution
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
Sangwook P. Kim, Gary S. Tyson
VVS
1998
IEEE
126views Visualization» more  VVS 1998»
15 years 11 months ago
Semi-Automatic Generation of Transfer Functions for Direct Volume Rendering
Although direct volume rendering is a powerful tool for visualizing complex structures within volume data, the size and complexity of the parameter space controlling the rendering...
Gordon L. Kindlmann, James W. Durkin
ASPLOS
1998
ACM
15 years 11 months ago
Compiler-Controlled Memory
Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a reasonable level...
Keith D. Cooper, Timothy J. Harvey
DAC
1998
ACM
15 years 11 months ago
Synthesis of Power-Optimized and Area-Optimized Circuits from Hierarchical Behavioral Descriptions
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
Ganesh Lakshminarayana, Niraj K. Jha
« Prev « First page 3768 / 4014 Last » Next »