Sciweavers

249 search results - page 2 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
LATIN
2010
Springer
14 years 2 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob
ICCAD
1992
IEEE
153views Hardware» more  ICCAD 1992»
13 years 11 months ago
Efficient techniques for inductance extraction of complex 3-D geometries
In this paper we describe combining a mesh analysis equation formulation technique with a preconditioned GORES matrix solution algorithm to accelerate the determination of inducta...
Mattan Kamon, Michael J. Tsuk, C. Smithhisler, Jac...
ECCV
2006
Springer
13 years 11 months ago
The Space of Multibody Fundamental Matrices: Rank, Geometry and Projection
We study the rank and geometry of the multibody fundamental matrix, a geometric entity characterizing the two-view geometry of dynamic scenes consisting of multiple rigidbody moti...
Xiaodong Fan, René Vidal
ECCV
2002
Springer
14 years 9 months ago
Generalized Rank Conditions in Multiple View Geometry with Applications to Dynamical Scenes
In this paper, the geometry of a general class of projections from ??? to ?! is examined, as a generalization of classic multiple view geometry in computer vision. It is shown that...
Kun Huang, Robert M. Fossum, Yi Ma
CVPR
2003
IEEE
14 years 9 months ago
Learning epipolar geometry from image sequences
We wish to determine the epipolar geometry of a stereo camera pair from image measurements alone. This paper describes a solution to this problem which does not require a parametr...
Yonatan Wexler, Andrew W. Fitzgibbon, Andrew Zisse...