We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Call a set of integers {b1, b2, . . . , bk} admissible if for any prime p, at least one congruence class modulo p does not contain any of the bi. Let (x) be the size of the largest...
The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely a...
In many applications it is necessary to track a moving and deforming boundary on the plane from infrequent, sparse measurements. For instance, each of a set of mobile observers may...
In modern application domains such as multimedia, molecular biology and medical imaging, similarity search in database systems is becoming an increasingly important task. Especial...
Hans-Peter Kriegel, Stefan Brecheisen, Peer Kr&oum...