Sciweavers

598 search results - page 21 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
ECCV
1998
Springer
14 years 10 months ago
Robust Techniques for the Estimation of Structure from Motion in the Uncalibrated Case
Abstract. Robust techniques are developed for determining structure from motion in the uncalibrated case. The structure recovery is based on previous work [7] in which it was shown...
Michael J. Brooks, Wojciech Chojnacki, Anton van d...
IPPS
2005
IEEE
14 years 2 months ago
Reducing Power with Performance Constraints for Parallel Sparse Applications
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
Guangyu Chen, Konrad Malkowski, Mahmut T. Kandemir...
ICASSP
2011
IEEE
13 years 12 days ago
A general framework for robust HOSVD-based indexing and retrieval with high-order tensor data
In this paper, we rst present a theorem that HOSVD-based representation of high-order tensor data provides a robust framework that can be used for a uni ed representation of the H...
Qun Li, Xiangqiong Shi, Dan Schonfeld
MOC
1998
71views more  MOC 1998»
13 years 8 months ago
Factorizing complex symmetric matrices with positive definite real and imaginary parts
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a growth factor bounded by 2 for LU factorization. This result adds to the classe...
Nicholas J. Higham
ML
2002
ACM
163views Machine Learning» more  ML 2002»
13 years 8 months ago
Structural Modelling with Sparse Kernels
A widely acknowledged drawback of many statistical modelling techniques, commonly used in machine learning, is that the resulting model is extremely difficult to interpret. A numb...
Steve R. Gunn, Jaz S. Kandola