Sciweavers

1611 search results - page 228 / 323
» A Library for Self-Adjusting Computation
Sort
View
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 11 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
GRAPHITE
2004
ACM
15 years 11 months ago
Augmenting the science centre and museum experience
Recent advances in computer graphics and interactive techniques have increased the visual quality and flexibility of Augmented Reality (AR) applications. This, in turn has increas...
Eric Woods, Mark Billinghurst, Julian Looser, Grah...
PARA
2004
Springer
15 years 11 months ago
A Family of High-Performance Matrix Multiplication Algorithms
During the last half-decade, a number of research efforts have centered around developing software for generating automatically tuned matrix multiplication kernels. These include ...
John A. Gunnels, Fred G. Gustavson, Greg Henry, Ro...
WOMPAT
2004
Springer
15 years 11 months ago
Runtime Adjustment of Parallel Nested Loops
OpenMP allows programmers to specify nested parallelism in parallel applications. In the case of scientific applications, parallel loops are the most important source of paralleli...
Alejandro Duran, Raúl Silvera, Julita Corba...
CLUSTER
2003
IEEE
15 years 11 months ago
Application-Bypass Reduction for Large-Scale Clusters
Process skew is an important factor in the performance of parallel applications, especially in large-scale clusters. Reduction is a common collective operation which, by its natur...
Adam Wagner, Darius Buntinas, Dhabaleswar K. Panda...