Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
1066
search results - page 214 / 214
»
Computing Private Set Operations with Linear Complexities
Sort
relevance
views
votes
recent
update
View
thumb
title
160
click to vote
COMPGEOM
2010
ACM
221
views
Discrete Geometry
»
more
COMPGEOM 2010
»
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
15 years 8 months ago
Download
www.daimi.au.dk
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
claim paper
Read More »
« Prev
« First
page 214 / 214
Last »
Next »