Sciweavers

151 search results - page 12 / 31
» Computing in Solvable Matrix Groups
Sort
View
APVIS
2008
13 years 11 months ago
ZAME: Interactive Large-Scale Graph Visualization
We present the Zoomable Adjacency Matrix Explorer (ZAME), a visualization tool for exploring graphs at a scale of millions of nodes and edges. ZAME is based on an adjacency matrix...
Niklas Elmqvist, Thanh-Nghi Do, Howard Goodell, Na...
AVBPA
2003
Springer
133views Biometrics» more  AVBPA 2003»
14 years 2 months ago
Visual Analysis of the Use of Mixture Covariance Matrices in Face Recognition
The quadratic discriminant (QD) classifier has proved to be simple and effective in many pattern recognition problems. However, it requires the computation of the inverse of the sa...
Carlos E. Thomaz, Duncan Fyfe Gillies
JACM
2000
119views more  JACM 2000»
13 years 9 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
PARA
1994
Springer
14 years 1 months ago
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
José M. Badía, Antonio M. Vidal
ICCV
2003
IEEE
14 years 11 months ago
Mirrors in motion: Epipolar geometry and motion estimation
In this paper we consider the images taken from pairs of parabolic catadioptric cameras separated by discrete motions. Despite the nonlinearity of the projection model, the epipol...
Christopher Geyer, Kostas Daniilidis