We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
This article deals with the digital inversive method for generating uniform pseudorandom numbers. Equidistribution and statistical independence properties of the generated pseudora...
Near-duplicate video detection is becoming a core-technology for analyzing the structure of a large-scale video archive. It, however, is naturally an O(n2 ) problem, where n is a ...
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...