STOC 2006 - PDF Preprint Papers

STOC 2006 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-2006 Paper

click to vote

STOC
2006
ACM

244views Algorithms» more STOC 2006»

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

14 years 4 months ago

Download www.eecs.umich.edu

We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...

Nir Ailon, Bernard Chazelle

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	244	Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform	claim
2	186	A subset spanner for Planar graphs, : with application to subset TSP	claim
3	180	Pricing for fairness: distributed resource allocation for multiple objectives	claim
4	174	Edge-disjoint paths in Planar graphs with constant congestion	claim
5	170	Hardness of approximate two-level logic minimization and PAC learning with membership queries	claim
6	168	A combinatorial characterization of the testable graph properties: it's all about regularity	claim
7	166	The Santa Claus problem	claim
8	166	New upper and lower bounds for randomized and quantum local search	claim
9	159	Learning a circuit by injecting values	claim
10	158	The effect of collusion in congestion games	claim
11	152	Private approximation of search problems	claim
12	149	Bounded-error quantum state identification and exponential separations in communication complexity	claim
13	147	The distance trisector curve	claim
14	141	Lattice problems and norm embeddings	claim
15	141	Zero-knowledge against quantum attacks	claim
16	140	Advances in metric embedding theory	claim
17	138	Searching dynamic point sets in spaces with bounded doubling dimension	claim
18	138	The PCP theorem by gap amplification	claim
19	134	Byzantine agreement in the full-information model in O(log n) rounds	claim
20	132	Near-optimal algorithms for unique games	claim
21	131	On maximizing welfare when utility functions are subadditive	claim
22	130	The complexity of computing a Nash equilibrium	claim
23	130	Online trading algorithms and robust option pricing	claim
24	130	On the fourier tails of bounded functions over the discrete cube	claim
25	130	Explicit capacity-achieving list-decodable codes	claim
26	129	Optimal phylogenetic reconstruction	claim
27	125	On earthmover distance, metric labeling, and 0-extension	claim
28	122	Hardness of cut problems in directed graphs	claim
29	122	Fast convergence to Wardrop equilibria by adaptive sampling methods	claim
30	121	Narrow proofs may be spacious: separating space and width in resolution	claim
31	121	On adequate performance measures for paging	claim
32	120	Black-box constructions for secure computation	claim
33	117	Pseudorandom walks on regular digraphs and the RL vs. L problem	claim
34	116	Linear degree extractors and the inapproximability of max clique and chromatic number	claim
35	116	Information-theoretically secure protocols and security under composition	claim
36	115	Zero knowledge with efficient provers	claim
37	114	Linear time low tree-width partitions and algorithmic consequences	claim
38	113	Logarithmic hardness of the directed congestion minimization problem	claim
39	112	A quasi-PTAS for unsplittable flow on line graphs	claim
40	112	Limitations of quantum coset states for graph isomorphism	claim
41	111	Counting independent sets up to the tree threshold	claim
42	111	A quasi-polynomial time approximation scheme for minimum weight triangulation	claim
43	109	The DLT priority sampling is essentially optimal	claim
44	108	Graph limits and parameter testing	claim
45	108	Local zero knowledge	claim
46	108	Extractors for a constant number of polynomially small min-entropy independent sources	claim
47	108	Gowers uniformity, influence of variables, and PCPs	claim
48	107	On basing one-way functions on NP-hardness	claim
49	107	Truthful randomized mechanisms for combinatorial auctions	claim
50	106	Finding small balanced separators	claim
51	100	On the solution-space geometry of random constraint satisfaction problems	claim
52	95	Conditional hardness for approximate coloring	claim
53	92	On the importance of idempotence	claim
54	91	Time-space trade-offs for predecessor search	claim
55	86	Sub-constant error low degree test of almost-linear size	claim
56	83	A randomized polynomial-time simplex algorithm for linear programming	claim
57	78	A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs	claim
58	78	Deterministic extractors for small-space sources	claim
59	77	Graph partitioning using single commodity flows	claim
60	76	A polynomial quantum algorithm for approximating the Jones polynomial	claim
61	74	Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree	claim
62	59	Reducibility among equilibrium problems	claim
63	57	Integrality gaps for sparsest cut and minimum linear arrangement problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers