Sciweavers

4315 search results - page 829 / 863
» Sorting in linear time
Sort
View
IPPS
1999
IEEE
13 years 12 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
VISUALIZATION
1999
IEEE
13 years 12 months ago
Tetrahedral Mesh Compression with the Cut-Border Machine
In recent years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. Even moderately fine t...
Stefan Gumhold, Stefan Guthe, Wolfgang Straß...
STACS
1999
Springer
13 years 12 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
SIGCOMM
1998
ACM
13 years 11 months ago
Fast and Scalable Layer Four Switching
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header elds of the packet such as source address,...
Venkatachary Srinivasan, George Varghese, Subhash ...
SIGCOMM
1998
ACM
13 years 11 months ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam