824 search results - page 101 / 165 » Efficient Distance Computation Between Non-Convex Objects |
SIGMOD
2010
ACM
14 years 23 days ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
ISBI
2007
IEEE
14 years 2 months ago
2007
IEEE
As we develop radiation treatment planning systems for head and neck cancer patients, there is a need to identify reference patients whose anatomical structures share similar feat...
WAE
1998
13 years 9 months ago
1998
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...