Abstract. We give conditions for hash table probing which minimize the expected number of collisions. A probing algorithm is determined by a sequence of numbers denoting jumps for ...
—In this paper, we consider the amplified-and-forward relaying in a multichannel system with linear processing capability at the relay. We propose an analytical approach to stud...
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
Estimating the result size of a join is an important query optimization problem as it determines the choice of a good query evaluation strategy. Yet, there are few efficient techni...
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...