45 search results - page 6 / 9 » Bounds for Real Roots and Applications to Orthogonal Polynom... |
RTSS
2005
IEEE
14 years 2 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
JPDC
2008
13 years 8 months ago
2008
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for...
GD
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
Learning-based superresolution (SR) are popular SR techniques that use application dependent priors to infer the missing details in low resolution images (LRIs). However, their pe...
ARITH
2007
IEEE
14 years 2 months ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....