177 search results - page 18 / 36 » Overdetermined Elliptic Systems |
JAL
1998
13 years 8 months ago
1998
Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this expon...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Matching based on local brightness is quite limited, because
small changes on local appearance invalidate the
constancy in brightness. The root of this limitation is its
treatme...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Magnetic resonance imaging (MRI) allows numerous Fourier domain sampling schemes such as Cartesian and non-Cartesian trajectories (e.g. Polar, circular, and spherical). On the oth...
ASPLOS
2009
ACM
14 years 9 months ago
2009
ACM
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
CVPR
2000
IEEE
14 years 10 days ago
2000
IEEE
This paper addresses the derivation of likelihood functions and confidence bounds for problems involving overdetermined linear systems with noise in all measurements, often referr...