An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng
This paper describes a database collecting natural color images, called the Natural Image Database, and shows how it is used for illuminant estimation problems. First, we present ...
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...
Singular points of scalar images in any dimensions are classified by a topological number. This number takes integer values and can efficiently be computed as a surface integral ...
Stiliyan Kalitzin, Bart M. ter Haar Romeny, Alfons...
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...