We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small numb...
The one-dimensional functional equation g(y(t)) = cg(z(t)) with known functions y and z and constant c is considered. The indeterminacies are calculated, and an algorithm for appro...
The paper deals with time-scaling transformations of dynamical systems. Such scaling functions operate a change of coordinates on the time axis of the system trajectories preservi...
Approximate data matching applications typically use similarity functions to quantify the degree of likeness between two data instances. There are several similarity functions ava...
Carlos A. Heuser, Francisco N. A. Krieser, Viviane...
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, r...
Khalil Amiri, David Petrou, Gregory R. Ganger, Gar...