STOC 2002 - PDF Preprint Papers

STOC 2002 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-2002 Paper

click to vote

STOC
2002
ACM

177views Algorithms» more STOC 2002»

15 years 21 days ago

Similarity estimation techniques from rounding algorithms

Download www.cs.princeton.edu

A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...

Moses Charikar

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	177	Similarity estimation techniques from rounding algorithms	claim
2	159	On the composition of authenticated byzantine agreement	claim
3	156	Selfish traffic allocation for server farms	claim
4	152	Universally composable two-party and multi-party secure computation	claim
5	149	The complexity of choosing an H-colouring (nearly) uniformly at random	claim
6	144	Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths	claim
7	141	Combinatorial optimization problems in self-assembly	claim
8	140	Finding nearest neighbors in growth-restricted metrics	claim
9	130	Secure multi-party quantum computation	claim
10	126	Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem	claim
11	124	Clairvoyant scheduling of random walks	claim
12	123	Optimal rate-based scheduling on multiprocessors	claim
13	121	Almost all graphs with average degree 4 are 3-colorable	claim
14	121	Average case analysis for batched disk scheduling and increasing subsequences	claim
15	119	Space-efficient approximate Voronoi diagrams	claim
16	119	The complexity of approximating entropy	claim
17	118	On the advantage over a random assignment	claim
18	117	Hardness amplification within NP	claim
19	115	Stability of load balancing algorithms in dynamic adversarial systems	claim
20	115	Reimer's inequality and tardos' conjecture	claim
21	112	Wait-free consensus with infinite arrivals	claim
22	111	The price of anarchy is independent of the network topology	claim
23	109	Approximate counting of inversions in a data stream	claim
24	107	Quantum lower bound for the collision problem	claim
25	105	Approximating the smallest grammar: Kolmogorov complexity in natural models	claim
26	103	Approximate clustering via core-sets	claim
27	103	Optimal finger search trees in the pointer machine	claim
28	101	An exponential separation between regular and general resolution	claim
29	101	Size space tradeoffs for resolution	claim
30	99	Recognizing string graphs in NP	claim
31	98	Hard examples for bounded depth frege	claim
32	97	Tight security proofs for the bounded-storage model	claim
33	96	Near-optimal sparse fourier representations via sampling	claim
34	96	Huffman coding with unequal letter costs	claim
35	95	Crawling on web graphs	claim
36	93	Competitive recommendation systems	claim
37	93	Competitive generalized auctions	claim
38	93	On communication over an entanglement-assisted quantum channel	claim
39	92	Tradeoffs in probabilistic packet marking for IP traceback	claim
40	91	The importance of being biased	claim
41	91	New results on monotone dualization and generating hypergraph transversals	claim
42	91	Girth and euclidean distortion	claim
43	90	Clifford algebras and approximating the permanent	claim
44	84	Random sampling and approximation of MAX-CSP problems	claim
45	81	Cache-oblivious priority queue and graph algorithm applications	claim
46	81	Monotonicity testing over general poset domains	claim
47	81	Fast, small-space algorithms for approximate histogram maintenance	claim
48	80	Strict polynomial-time in simulation and extraction	claim
49	80	Resolution lower bounds for the weak pigeonhole principle	claim
50	79	Computing the betti numbers of arrangements	claim
51	73	Solving convex programs by random walks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers