Sciweavers

249 search results - page 9 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
FCS
2006
13 years 9 months ago
New Approach To A Class Of Matrices
The displacement structure is extended to a Kronecker matrix W Z. A new class of Kronecker-like matrices with the displacement rank r, r < n will be formulated and presented. ...
Z. Chen
SIGGRAPH
1992
ACM
13 years 11 months ago
Predicting reflectance functions from complex surfaces
We describe a physically-based Monte Carlo technique for approximating bidirectional reflectance distribution functions (BRDFs) for a large class of geometries by directly simulat...
Stephen H. Westin, James Arvo, Kenneth E. Torrance
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
MFCS
2007
Springer
14 years 1 months ago
Reachability Problems in Quaternion Matrix and Rotation Semigroups
Abstract. We examine computational problems on quaternion matrix and rotation semigroups. It is shown that in the ultimate case of quaternion matrices, in which multiplication is s...
Paul Bell, Igor Potapov
SI3D
2012
ACM
12 years 3 months ago
Interactive rendering of acquired materials on dynamic geometry using bandwidth prediction
Shading complex materials such as acquired reflectances in multilight environments is computationally expensive. Estimating the shading integral requires multiple samples of the ...
Mahdi M. Bagher, Cyril Soler, Kartic Subr, Laurent...