Sciweavers

19320 search results - page 16 / 3864
» On the complexity of computing determinants
Sort
View
IJHPCA
2008
104views more  IJHPCA 2008»
13 years 9 months ago
Low-Complexity Principal Component Analysis for Hyperspectral Image Compression
Principal component analysis (PCA) is an effective tool for spectral decorrelation of hyperspectral imagery, and PCA-based spectral transforms have been employed successfully in co...
Qian Du, James E. Fowler
IEEEARES
2010
IEEE
14 years 4 months ago
A Complexity Based Model for Quantifying Forensic Evidential Probabilities
- An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexi...
Richard E. Overill, Jantje A. M. Silomon, Kam-Pui ...
CSR
2007
Springer
14 years 3 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma
CVPR
2001
IEEE
14 years 11 months ago
Efficient Computation of Adaptive Threshold Surfaces for Image Binarization
The problem of binarization of gray level images acquired under nonuniform illumination is reconsidered. Yanowitz and Bruckstein proposed to use for image binarization an adaptive...
Ilya Blayvas, Alfred M. Bruckstein, Ron Kimmel
DFG
1992
Springer
14 years 1 months ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski