In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. This algorithm can be applied to a wide range of parallel computing systems. To ...
Jens Hermans, Michael Schneider 0002, Johannes Buc...
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
This paper describes a sub-mW motion estimation processor core for MPEG-4 video encoding. It features a Gradient Descent Search algorithm whose computation power is only 7% of the...
Preference-based search is the problem of finding an item that matches best with a user's preferences. User studies show that example-based tools for preference-based search c...