172 search results - page 28 / 35 » On the cost of searching signature trees |
CP
2008
Springer
13 years 9 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
IJCAI
2001
13 years 9 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
SEBD
1997
13 years 9 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
PRIS
2004
13 years 9 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...