1523 search results - page 43 / 305 » The Computational Complexity of Linear Optics |
ISSAC
2004
Springer
14 years 2 months ago
2004
Springer
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
KES
1998
Springer
14 years 1 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
CVPR
2007
IEEE
14 years 22 days ago
2007
IEEE
This paper presents minimal solutions for the geometric parameters of a camera rotating about its optical centre. In particular we present new 2 and 3 point solutions for the homo...
DAC
1999
ACM
14 years 1 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
ISSAC
2005
Springer
14 years 2 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....