Sciweavers

2880 search results - page 44 / 576
» Approximate Range Searching
Sort
View
CEC
2007
IEEE
15 years 6 months ago
Heuristic search for non-linear cryptanalytic approximations
— In this work, we show that heuristic techniques (particularly Simulated Annealing) can be successfully applied in the search of good non-linear approximations of cryptographic ...
Juan M. Estévez-Tapiador, Julio Césa...
IMA
2007
Springer
97views Cryptology» more  IMA 2007»
15 years 6 months ago
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...
Juan M. Estévez-Tapiador, John A. Clark, Ju...
CVPR
2010
IEEE
14 years 10 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
VLDB
2002
ACM
113views Database» more  VLDB 2002»
16 years 2 days ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 4 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani