Sciweavers

1802 search results - page 166 / 361
» Sparse Computations with PEI
Sort
View
CF
2006
ACM
15 years 8 months ago
The potential of the cell processor for scientific computing
The slowing pace of commodity microprocessor performance improvements combined with ever-increasing chip power demands has become of utmost concern to computational scientists. As...
Samuel Williams, John Shalf, Leonid Oliker, Shoaib...
CP
2006
Springer
15 years 8 months ago
When Interval Analysis Helps Inter-block Backtracking
Inter-block backtracking (IBB) computes all the solutions of sparse systems of non-linear equations over the reals. This algorithm, introduced in 1998 by Bliek et al., handles a sy...
Bertrand Neveu, Gilles Chabert, Gilles Trombettoni
UAI
2001
15 years 5 months ago
Graphical Models for Game Theory
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
Michael J. Kearns, Michael L. Littman, Satinder P....
MICCAI
2009
Springer
16 years 5 months ago
A Riemannian Framework for Orientation Distribution Function Computing
Compared with Diffusion Tensor Imaging (DTI), High Angular Resolution Imaging (HARDI) can better explore the complex microstructure of white matter. Orientation Distribution Functi...
Jian Cheng, Aurobrata Ghosh, Tianzi Jiang, Rachid ...
SIAMSC
2011
177views more  SIAMSC 2011»
14 years 11 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad