FOCS 2009 - PDF Preprint Papers

FOCS 2009 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-2009 Paper

click to vote

FOCS
2009
IEEE

179views Theoretical Computer Science» more FOCS 2009»

The Data Stream Space Complexity of Cascaded Norms

14 years 7 months ago

Download www.almaden.ibm.com

Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is deﬁned by ...

T. S. Jayram, David P. Woodruff

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	179	The Data Stream Space Complexity of Cascaded Norms	claim
2	168	Distance Oracles for Sparse Graphs	claim
3	165	Space-Efficient Framework for Top-k String Retrieval Problems	claim
4	164	(Meta) Kernelization	claim
5	163	Faster Generation of Random Spanning Trees	claim
6	163	Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions	claim
7	151	Dynamic and Non-uniform Pricing Strategies for Revenue Maximization	claim
8	146	Extracting Correlations	claim
9	144	Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities	claim
10	139	Constructing Small-Bias Sets from Algebraic-Geometric Codes	claim
11	138	Decomposing Coverings and the Planar Sensor Cover Problem	claim
12	138	Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size	claim
13	138	The Complexity of Rationalizing Network Formation	claim
14	137	Convergence to Equilibrium in Local Interaction Games	claim
15	135	Instance-Optimal Geometric Algorithms	claim
16	135	Optimal Quantum Strong Coin Flipping	claim
17	131	Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks	claim
18	130	Reducibility among Fractional Stability Problems	claim
19	126	Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions	claim
20	126	Local Graph Partitions for Approximation and Testing	claim
21	123	Orthogonal Range Reporting in Three and Higher Dimensions	claim
22	122	Randomized Self-Assembly for Exact Shapes	claim
23	121	Regularity Lemmas and Combinatorial Algorithms	claim
24	121	Learning and Smoothed Analysis	claim
25	120	Linear Systems over Composite Moduli	claim
26	120	Blackbox Polynomial Identity Testing for Depth 3 Circuits	claim
27	117	On Allocating Goods to Maximize Fairness	claim
28	117	Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda's Theorem	claim
29	116	Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy	claim
30	115	Smoothed Analysis of Multiobjective Optimization	claim
31	114	Oblivious Routing for the Lp-norm	claim
32	109	An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design	claim
33	108	Symmetry and Approximability of Submodular Maximization Problems	claim
34	106	2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness	claim
35	105	Planarity Allowing Few Error Vertices in Linear Time	claim
36	104	Efficient Sketches for Earth-Mover Distance, with Applications	claim
37	102	Higher Eigenvalues of Graphs	claim
38	101	Composition of Low-Error 2-Query PCPs Using Decodable PCPs	claim
39	100	Agnostic Learning of Monomials by Halfspaces Is Hard	claim
40	99	Bit Encryption Is Complete	claim
41	98	Constraint Satisfaction Problems of Bounded Width	claim
42	97	Two-Message Quantum Interactive Proofs Are in PSPACE	claim
43	97	Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers	claim
44	97	How to Round Any CSP	claim
45	97	Choice-Memory Tradeoff in Allocations	claim
46	96	Models for the Compressible Web	claim
47	96	KKL, Kruskal-Katona, and Monotone Nets	claim
48	95	On the Power of Randomization in Algorithmic Mechanism Design	claim
49	94	The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems	claim
50	94	Bounded Independence Fools Halfspaces	claim
51	93	A Complete Characterization of Statistical Query Learning with Applications to Evolvability	claim
52	92	The Intersection of Two Halfspaces Has High Threshold Degree	claim
53	91	Delaunay Triangulations in O(sort(n)) Time and More	claim
54	90	Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP	claim
55	90	Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES	claim
56	88	A Parallel Repetition Theorem for Any Interactive Argument	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers