Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

67

Voted

SODA
2004
ACM

80views Algorithms» more SODA 2004»

Efficient algorithms for bichromatic separability

15 years 4 months ago

Efficient algorithms for bichromatic separability

Download biogeometry.duke.edu

Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun

Real-time Traffic

Algorithms | SODA 2004 |

claim paper

Related Content

» Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors

» FINCH evaluating reverse kNearestNeighbor queries on location data

» Monochromatic and bichromatic reverse skyline search over uncertain databases

» An efficient parallel algorithm for building the separating tree

» Dynamic HalfSpace Reporting Geometric Optimization and Minimum Spanning Trees

» Facility location problems in the plane based on reverse nearest neighbor queries

» Connected dominating sets on dynamic geometric graphs

» Reverse Topk Queries

» Reverse Furthest Neighbors in Spatial Databases

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	SODA
Authors	Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun

Comments (0)