28888 search results - page 386 / 5778 » Computability and complexity in analysis |
178
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...
186
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...
193
click to vote
INFFUS
2007
15 years 6 months ago
2007
The task of enhancing the perception of a scene by combining information captured by different sensors is usually known as image fusion. The pyramid decomposition and the Dual-Tr...