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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
20
click to vote
COMPGEOM
2010
ACM
favorite
Email
discuss
report
121
views
Discrete Geometry
»
more
COMPGEOM 2010
»
Tight lower bounds for halfspace range searching
14 years 29 days ago
Download
www.cs.umd.edu
Sunil Arya, David M. Mount, Jian Xia
Real-time Traffic
COMPGEOM 2010
|
claim paper
Related Content
»
Unconditional lower bounds for learning intersections of halfspaces
»
A general approach for cacheoblivious range reporting and approximate range counting
»
ShallowLowLight Trees and Tight Lower Bounds for Euclidean Spanners
»
On the importance of idempotence
»
A tight lower bound for parity in noisy communication networks
»
The cell probe complexity of dynamic range counting
»
Tight lower bounds for the online labeling problem
»
Tight Lower Bounds for Certain Parameterized NPHard Problems
»
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
more »
Post Info
More Details (n/a)
Added
10 Jul 2010
Updated
10 Jul 2010
Type
Conference
Year
2010
Where
COMPGEOM
Authors
Sunil Arya, David M. Mount, Jian Xia
Comments
(0)
Researcher Info
Discrete Geometry Study Group
Computer Vision