340 search results - page 9 / 68 » Efficient algorithms for bichromatic separability |
SIGMOD
1997
ACM
15 years 1 months ago
1997
ACM
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
GMP
2008
IEEE
14 years 9 months ago
2008
IEEE
We perform collision detection between static rigid objects using a bounding volume hierarchy which consists of an oriented bounding box (OBB) tree enhanced with bounding spheres. ...
120
click to vote
JDCTA
2010
14 years 4 months ago
2010
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
BIOINFORMATICS
2006
14 years 9 months ago
2006
A small class of RNA molecules, in particular the tiny genomes of viroids, are circular. Yet most structure prediction algorithms handle only linear RNAs. The most straightforward ...