727 search results - page 19 / 146 » Private approximation of search problems |
128
click to vote
TODS
2002
15 years 6 days ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
97
Voted
IMA
2007
Springer
15 years 6 months ago
2007
Springer
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...
138
click to vote
COMGEO
2004
ACM
15 years 12 days ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
167
Voted
CORR
1999
Springer
15 years 7 days ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
95
Voted
EMO
2009
Springer
15 years 7 months ago
2009
Springer
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...