Title: Approximate Range Counting
Speaker: Theocharis Malamatos
Max-Planck Institute 

Date: Friday, May 6, 2005
Time 11-12
Venue: Room 3464, HKUST


Abstract
Answering range queries is a problem of fundamental importance in
spatial information retrieval and computational geometry. The
objective is to store a finite set of points so that it is possible to
quickly count the points lying inside a given query range.
Here we present the first space-time tradeoffs for approximate
spherical range counting queries and also we show how to apply our
methods for solving the approximate k-nearest neighbor problem.

Joint work with Sunil Arya (UST) and David Mount (U Maryland).