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
2766
search results - page 554 / 554
»
Algorithms for trigonometric polynomials
Sort
relevance
views
votes
recent
update
View
thumb
title
123
Voted
FOCS
2008
IEEE
172
views
Theoretical Computer Science
»
more
FOCS 2008
»
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
15 years 9 months ago
Download
theory.stanford.edu
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
claim paper
Read More »
« Prev
« First
page 554 / 554
Last »
Next »