STOC 1998 - PDF Preprint Papers

STOC 1998 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-1998 Paper

click to vote

STOC
1998
ACM

190views Algorithms» more STOC 1998»

Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

13 years 9 months ago

Download www.cs.princeton.edu

We address the problem of designing data structures that allow eﬃcient search for approximate nearest neighbors. More speciﬁcally, given a database consisting of a set of vecto...

Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	190	Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces	claim
2	167	An Improved Approximation Algorithm for Multiway Cut	claim
3	141	Almost Optimal Dispersers	claim
4	139	Approximation Schemes for Euclidean k-Medians and Related Problems	claim
5	139	Analysis of Low Density Codes and Improved Designs Using Irregular Graphs	claim
6	135	Checking Polynomial Identities over any Field: Towards a Derandomization?	claim
7	129	Planar Map Graphs	claim
8	125	Spot-Checkers	claim
9	121	Non-Interactive and Non-Malleable Commitment	claim
10	115	On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas	claim
11	115	Weak Alternating Automata and Tree Automata Emptiness	claim
12	115	Asymptotic Acceleration of Solving Multivariate Polynomial Systems of Equations	claim
13	112	Quantum Circuits with Mixed States	claim
14	112	Exact Sampling and Approximate Counting Techniques	claim
15	112	Adaptive Packet Routing for Bursty Adversarial Traffic	claim
16	111	A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents	claim
17	109	Approximating Geometrical Graphs via "Spanners" and "Banyans"	claim
18	108	On Indexed Data Broadcast	claim
19	105	Concurrent Zero-Knowledge	claim
20	105	Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality	claim
21	99	Quantum vs. Classical Communication and Computation	claim
22	96	Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks	claim
23	92	The Cost of the Missing Bit: Communication Complexity with Help	claim
24	89	Minimizing Stall Time in Single and Parallel Disk Systems	claim
25	89	The Power of a Pebble: Exploring and Mapping Directed Graphs	claim
26	81	Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators	claim
27	80	Algorithms for Capacitated Vehicle Routing	claim
28	79	Multicasting in Heterogeneous Networks	claim
29	77	Segmentation Problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers