by Steven M. LaValle. Presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics.
a library of functions and a framework to interface with crypto algorithms provided by the calling application, built-in, or provided through shared libraries.
Anat Levin, Dani Lischinski, Yair Weiss - a computer-assisted process of adding color to a monochrome image or movie with a relatively modest amount of user input.
works by recording the images produced by an adaptive optics front-end at high speed (20 frames per second or more). Software then checks each one to pick the sharpest ones.
contest offers a cash prize for the winning entry. In the past it has ranged from a low of $100 to a high of $500. Cash prizes for second place are usually awarded as well.
Two new (in the sense that, as far as I know, they were never before programmed for a computer) algorithms for the classical Tower of Hanoi problem and their variations are discussed.
a digital signal processing (DSP) technique for identifying frequency components of a signal, published by Dr. Gerald Goertzel in 1958. While the general Fast Fourier transform (FFT) algorithm computes evenly across the bandwidth of the incoming signal, the Goertzel algorithm looks at specific, predetermined frequency.
a free (under GNU Lesser GPL) library which provides a uniform interface to a large number of hash algorithms. These algorithms can be used to compute checksums, message digests, and other signatures.