727 search results - page 40 / 146 » Private approximation of search problems |
SODA
2012
ACM
12 years 16 days ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
SISAP
2009
IEEE
14 years 4 months ago
2009
IEEE
—In the demonstration we will show a system for searching by similarity and automatically classifying images in a very large dataset. The demonstrated techniques are based on the...
WSC
2004
13 years 11 months ago
2004
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
SISAP
2009
IEEE
14 years 4 months ago
2009
IEEE
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...