329 search results - page 1 / 66 » On Range Searching with Semialgebraic Sets |
MFCS
1992
Springer
13 years 9 months ago
1992
Springer
ESORICS
2009
Springer
14 years 10 days ago
2009
Springer
For nearest neighbor search, a user queries a server for nearby points of interest (POIs) with his/her location information. Our aim is to protect the user’s sensitive informatio...
MOR
2010
13 years 4 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
CCCG
2003
13 years 7 months ago
2003
We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to sol...
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...