Sciweavers

921 search results - page 33 / 185
» Abstract Matrix Arithmetic
Sort
View
SIAMSC
2008
127views more  SIAMSC 2008»
13 years 7 months ago
Fast (Structured) Newton Computations
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
Thomas F. Coleman, Wei Xu
EUROPAR
1997
Springer
13 years 11 months ago
A Relational Approach to the Compilation of Sparse Matrix Programs
Abstract. We present a relational algebra based framework for compiling e cient sparse matrix code from dense DO-ANY loops and a speci cation of the representation of the sparse ma...
Vladimir Kotlyar, Keshav Pingali, Paul Stodghill
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 11 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
ER
2009
Springer
92views Database» more  ER 2009»
14 years 2 months ago
On Matrix Representations of Participation Constraints
Abstract. We discuss the existence of matrix representations for generalised and minimum participation constraints which are frequently used in database design and conceptual model...
Sven Hartmann, Uwe Leck, Sebastian Link
PSIVT
2009
Springer
130views Multimedia» more  PSIVT 2009»
14 years 2 months ago
Compact Fundamental Matrix Computation
Abstract. A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likeli...
Kenichi Kanatani, Yasuyuki Sugaya