Sciweavers

1244 search results - page 66 / 249
» Searching in Higher Dimension
Sort
View
AFRICACRYPT
2010
Springer
14 years 4 months ago
Parallel Shortest Lattice Vector Enumeration on Graphics Cards
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...
AAAI
2012
12 years 10 days ago
Double-Bit Quantization for Hashing
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...
Weihao Kong, Wu-Jun Li
GECCO
2003
Springer
14 years 3 months ago
Quad Search and Hybrid Genetic Algorithms
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...
L. Darrell Whitley, Deon Garrett, Jean-Paul Watson
ASPDAC
2004
ACM
101views Hardware» more  ASPDAC 2004»
14 years 3 months ago
A sub-mW MPEG-4 motion estimation processor core for mobile video application
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...
Yuki Kuroda, Junichi Miyakoshi, Masayuki Miyama, K...
FQAS
2006
Springer
85views Database» more  FQAS 2006»
14 years 1 months ago
The Lookahead Principle for Preference Elicitation: Experimental Results
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...
Paolo Viappiani, Boi Faltings, Pearl Pu