676 search results - page 29 / 136 » Sub-stochastic matrix analysis for bounds computation - Theo... |
CGF
2010
13 years 7 months ago
2010
Programmable shading provides artistic control over materials and geometry, but the black box nature of shaders makes some rendering optimizations difficult to apply. In many case...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
ISSAC
1997
Springer
13 years 11 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
PAMI
2008
13 years 7 months ago
2008
In data-analysis problems with a large number of dimension, principal component analysis based on L2-norm (L2PCA) is one of the most popular methods, but L2-PCA is sensitive to out...