Sciweavers

5183 search results - page 640 / 1037
» The Complexity of Distributions
Sort
View
IPPS
2000
IEEE
15 years 11 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
IPPS
2000
IEEE
15 years 11 months ago
Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
Yuanyuan Yang, Jianchao Wang
IPPS
2000
IEEE
15 years 11 months ago
Augmenting Modern Superscalar Architectures with Configurable Extended Instructions
The instruction sets of general-purpose microprocessors are designed to offer good performance across a wide range of programs. The size and complexity of the instruction sets, how...
Xianfeng Zhou, Margaret Martonosi
SSIAI
2000
IEEE
15 years 11 months ago
Pairwise Markov Random Fields and its Application in Textured Images Segmentation
The use of random fields, which allows one to take into account the spatial interaction among random variables in complex systems, is a frequent tool in numerous problems of stati...
Wojciech Pieczynski, Abdel-Nasser Tebbache
SIGGRAPH
2000
ACM
15 years 11 months ago
A fast relighting engine for interactive cinematic lighting design
We present new techniques for interactive cinematic lighting design of complex scenes that use procedural shaders. Deep-framebuffers are used to store the geometric and optical in...
Reid Gershbein, Pat Hanrahan