2239 search results - page 12 / 448 » Computing with abstract matrix structures |
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
Abstract Summary of results The subcubic (O(n ) for < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they d...
ICVS
2003
Springer
15 years 2 months ago
2003
Springer
This paper shows how to construct a linear deformable model for graph structure by performing principal components analysis (PCA) on the vectorised adjacency matrix. We commence b...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
113
click to vote
CGF
2010
14 years 8 months ago
2010
Recent advances in GPU programmability and architecture have allowed for the generation of ray casted or ray traced images at interactive rates. How quickly these images can be ge...
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
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...