19320 search results - page 244 / 3864 » On the complexity of computing determinants |
172
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
179
click to vote
DLT
2009
15 years 4 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
160
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper, we measure the responses of image patches, used as filters, on different image ensembles and examine how the responses are affected by reducing the resolution of th...
176
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, we propose a novel approach to model shape variations. It encodes sparsity, exploits geometric redundancy, and accounts for the different degrees of local variation...