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
2766
search results - page 554 / 554
»
Algorithms for trigonometric polynomials
Sort
relevance
views
votes
recent
update
View
thumb
title
22
click to vote
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
14 years 2 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 »