727 search results - page 20 / 146 » Private approximation of search problems |
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
CVPR
2010
IEEE
13 years 10 months ago
2010
IEEE
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...
ADC
2006
Springer
14 years 4 months ago
2006
Springer
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
SSDBM
2002
IEEE
14 years 3 months ago
2002
IEEE
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
AAAI
2000
14 years 8 days ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...