1573 search results - page 202 / 315 » A Data Structure for Sponsored Search |
138
click to vote
JMLR
2012
13 years 2 months ago
2012
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
101
click to vote
ADBIS
2007
Springer
15 years 6 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
CP
2007
Springer
15 years 6 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
101
click to vote
CP
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
We have developed an evolutionary approach for the flexible docking that is now an important component of a rational drug design. This automatic docking tool, referred to as the G...