1263 search results - page 142 / 253 » A* with Bounded Costs |
VLDB
1998
ACM
14 years 1 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
VLDB
1994
ACM
14 years 1 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...
FOCS
1989
IEEE
14 years 1 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
VISUALIZATION
1995
IEEE
14 years 1 months ago
1995
IEEE
We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greed...
EDBT
2010
ACM
14 years 29 days ago
2010
ACM
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...