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...
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...
Ying Wu (Northwestern University), Jialue Fan (Nor...
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...
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...
This paper addresses the derivation of likelihood functions and confidence bounds for problems involving overdetermined linear systems with noise in all measurements, often referr...