249 search results - page 44 / 50 » Geometry and the complexity of matrix multiplication |
SIGGRAPH
2000
ACM
14 years 1 months ago
2000
ACM
Visualization of very complex scenes can be significantly accelerated using occlusion culling. In this paper we present a visibility preprocessing method which efficiently compu...
JC
2000
13 years 8 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
SCA
2007
13 years 11 months ago
2007
Although mesh-based methods are efficient for simulating simple hyperelasticity, maintaining and adapting a mesh-based representation is less appealing in more complex scenarios, ...
NIPS
2000
13 years 10 months ago
2000
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
CW
2002
IEEE
14 years 1 months ago
2002
IEEE
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...