Semantic Scholar uses AI to extract papers important to this topic.
Due to its computation efficiency and retrieval quality, hashing has been widely applied to approximate nearest neighbor search… Expand In this paper, we present a new hashing method to learn compact binary codes for highly efficient image retrieval on large-scale… Expand Abstract Biometric technology is likely to provide a new level of security to various applications. Yet if the stored biometric… Expand There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision… Expand The lifted maximum rank distance codes are considered. It is shown that these codes form structures which are transversal designs… Expand We prove strong lower bounds for the space complexity of (/spl epsi/, /spl delta/)-approximating the number of distinct elements… Expand The author surveys algorithmic results obtained using low-distortion embeddings of metric spaces into (mostly) normed spaces. He… Expand Genetic algorithms (GAs) are multi-dimensional and stochastic search methods, involving complex interactions among their… Expand Universal bounds for the cardinality of codes in the Hamming space F/sub r//sup n/ with a given minimum distance d and/or dual… Expand Abstract This paper presents several theorems concerning the nature of deception and the central role that deception plays in… Expand