SODA 2010 - PDF Preprint Papers

SODA 2010 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-2010 Paper

click to vote

SODA
2010
ACM

704views Algorithms» more SODA 2010»

A locality-sensitive hash for real vectors

14 years 8 months ago

Download siam.org

We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...

Tyler Neylon

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	704	A locality-sensitive hash for real vectors	claim
2	426	Shape Replication Through Self-Assembly and RNase Enzymes	claim
3	409	Data Structures for Range Minimum Queries in Multidimensional Arrays	claim
4	397	A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover	claim
5	397	Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls	claim
6	371	Online Learning with Queries	claim
7	290	Rumour spreading and graph conductance	claim
8	278	The edge disjoint paths problem in Eulerian graphs and $4$-edge-connected graphs	claim
9	261	Bidimensionality and Kernels	claim
10	248	Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface	claim
11	241	A Model of Computation for MapReduce	claim
12	238	How good is the Chord algorithm?	claim
13	235	Algorithmic Lower Bounds for Problems Parameterized by Clique-width	claim
14	234	PTAS for maximum weight independent set problem with random weights in bounded degree graphs	claim
15	232	On the Optimality of Spiral Search	claim
16	232	Faster exponential time algorithms for the shortest vector problem	claim
17	231	Asymmetric Traveling Salesman Path and Directed Latency Problems	claim
18	224	Reconstructing approximate phylogenetic trees from quartet samples	claim
19	222	Finding the Jaccard Median	claim
20	219	Algorithms and Complexity for Periodic Real-Time Scheduling	claim
21	216	Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs	claim
22	216	On linear and semidefinite programming relaxations for hypergraph matching	claim
23	215	Compact Ancestry Labeling Schemes for XML Trees	claim
24	215	Approximability of Robust Network Design	claim
25	214	Amplified Hardness of Approximation for VCG-Based Mechanisms	claim
26	214	A Fourier space algorithm for solving quadratic assignment problems	claim
27	213	Regular Expression Matching with Multi-Strings	claim
28	210	A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics	claim
29	209	Counting Stars and Other Small Subgraphs in Sublinear Time	claim
30	208	Correlation Robust Stochastic Optimization	claim
31	205	Maximum Flows and Parametric Shortest Paths in Planar Graphs	claim
32	202	Counting Inversions, Offline Orthogonal Range Counting, and Related Problems	claim
33	201	Incentive Compatible Budget Elicitation in Multi-unit Auctions	claim
34	201	Efficient Broadcast on Random Geometric Graphs	claim
35	200	Fully-Functional Succinct Trees	claim
36	200	Algorithms for ray class groups and Hilbert class fields	claim
37	197	Quasirandom Load Balancing	claim
38	196	Deletion Without Rebalancing in Balanced Binary Trees	claim
39	196	Streaming Algorithms for extent problems in high dimensions	claim
40	190	One-Counter Markov Decision Processes	claim
41	190	Lower Bounds for Sparse Recovery	claim
42	189	Correlation Clustering with Noisy Input	claim
43	187	An Improved Competitive Algorithm for Reordering Buffer Management	claim
44	186	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem	claim
45	185	Paired Approximation Problems and Incompatible Inapproximabilities	claim
46	185	Solving MAX-r-SAT Above a Tight Lower Bound	claim
47	181	On the Cell Probe Complexity of Dynamic Membership	claim
48	181	Near-Optimal Sublinear Time Algorithms for Ulam Distance	claim
49	179	Property Testing and Parameter Testing for Permutations	claim
50	178	Basis Reduction, and the Complexity of Branch-and-Bound	claim
51	178	Tree Embeddings for Two-Edge-Connected Network Design	claim
52	178	1-Pass Relative-Error Lp-Sampling with Applications	claim
53	177	On the Exact Space Complexity of Sketching and Streaming Small Norms	claim
54	177	Convergence, Stability, and Discrete Approximation of Laplace Spectra	claim
55	176	The scaling window for a random graph with a given degree sequence	claim
56	176	Self-improving Algorithms for Convex Hulls	claim
57	176	Highway Dimension, Shortest Paths, and Provably Efficient Algorithms	claim
58	175	An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling	claim
59	175	Lower Bounds for Testing Triangle-freeness in Boolean Functions	claim
60	175	Optimally Reconstructing Weighted Graphs Using Queries	claim
61	175	Fast SDP Algorithms for Constraint Satisfaction Problems	claim
62	174	Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs	claim
63	174	Differentially Private Combinatorial Optimization	claim
64	173	Distributed Agreement with Optimal Communication Complexity	claim
65	172	A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing	claim
66	171	On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second Order Logic	claim
67	171	Coresets and Sketches for High Dimensional Subspace Approximation Problems	claim
68	171	A deterministic truthful PTAS for scheduling related machines	claim
69	171	Differential Privacy in New Settings	claim
70	169	VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension	claim
71	169	Efficiently Decodable Non-adaptive Group Testing	claim
72	168	On the possibility of faster SAT algorithms	claim
73	168	An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem	claim
74	167	Inapproximability for planar embedding problems	claim
75	164	Differentially Private Approximation Algorithms	claim
76	164	Hardness Results for Homology Localization	claim
77	163	Geometric optimization and sums of algebraic functions	claim
78	163	SRPT is 1.86-Competitive for Completion Time Scheduling	claim
79	162	The forest hiding problem	claim
80	162	Fast distance multiplication of unit-Monge matrices	claim
81	160	Solving Simple Stochastic Tail Games	claim
82	160	Cell-probe lower bounds for prefix sums and matching brackets	claim
83	157	Testing monotone high-dimensional distributions	claim
84	155	A Space--Time Tradeoff for Permutation Problems	claim
85	155	Road Network Reconstruction for Organizing Paths	claim
86	153	An Improved Construction of Progression-Free Sets	claim
87	152	Solving the Replacement Paths Problem for Planar Directed Graphs in O(n*log n) Time	claim
88	152	The focus of attention problem	claim
89	152	Towards the Randomized k-Server Conjecture: A Primal-Dual Approach	claim
90	151	The Complexity of Guarding Terrains	claim
91	151	EDF-schedulability of synchronous periodic task systems is coNP-hard	claim
92	151	A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks	claim
93	149	Sharp kernel clustering algorithms and their associated Grothendieck inequalities	claim
94	149	Resource Minimization for Fire Containment	claim
95	149	Data-Specific Analysis of String Sorting	claim
96	149	Utilitarian Mechanism Design for Multi-Objective Optimization	claim
97	148	Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms	claim
98	147	Energy Efficient Scheduling via Partial Shutdown	claim
99	146	Classified Stable Matching	claim
100	145	On the Equilibria of Alternating Move Games	claim
101	144	Cell-Probe Lower Bounds for Succinct Partial Sums	claim
102	143	Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies	claim
103	142	Towards a calculus for non-linear spectral gaps	claim
104	142	Speeding up random walks with neighborhood exploration	claim
105	141	Monotonicity in Bargaining Networks	claim
106	140	Vertices of Degree k in Random Maps	claim
107	135	Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications	claim
108	135	Testing Monotone Continuous Distributions on High-dimensional Real Cubes	claim
109	133	Testing additive integrality gaps	claim
110	133	Terrain Guarding is NP-Hard	claim
111	132	Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees	claim
112	122	Price of Anarchy for Greedy Auctions	claim
113	121	Lower bounds for Edit Distance and Product Metrics via Poincare-Type Inequalities	claim
114	115	Inapproximability for VCG-Based Combinatorial Auctions	claim
115	106	Genus and the Geometry of the Cut Graph	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers