676 search results - page 4 / 136 » Sub-stochastic matrix analysis for bounds computation - Theo... |
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper, we propose a novel robust retrieval and classification system for video and motion events based on null space representation. In order to analyze the robustness of ...
ISSAC
2005
Springer
14 years 25 days ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
SIAMREV
2010
13 years 2 months ago
2010
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
CCGRID
2003
IEEE
14 years 19 days ago
2003
IEEE
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and ...