An O(k 3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design Julia Chuzhoy∗ Toyota Technological Institute Chicago, IL 60637

Source URL: ttic.uchicago.edu

1 Blind Denoising with Random Greedy Pursuits Manuel Moussallam∗ , Alexandre Gramfort† , Laurent Daudet∗ , and Ga¨el Richard† ∗ Institut

Source URL: arxiv.org

• Signal processing
• Mathematical analysis
• Electrical engineering
• Timefrequency analysis
• Statistics
• Noise
• Wavelet
• Multivariate statistics
• Time series analysis
• IP
• Noise reduction
• Sparse approximation

Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping Richard S. Sutton, Csaba Szepesv´ari, Alborz Geramifard, Michael Bowling Reinforcement Learning and Artificial Intelligence Laboratory Depa

Source URL: uai2008.cs.helsinki.fi

First Steps - On-line and Approximation Algorithms Fall Semester, Exercise 1: Jan 5, 2011 Lecturer: Prof. Yossi Azar

Source URL: tq.cs.tau.ac.il

Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs Marek Karpinski∗ Richard Schmied†

Source URL: theory.cs.uni-bonn.de

C Glasgow Mathematical Journal TrustGlasgow Math. J–106.  doi:S0017089509990176. DIOPHANTINE APPROXIMATION BY PRIMES ¨

Source URL: users.utu.fi

Function Approximation Using Tile and Kanerva Coding For Multi-Agent Systems Cheng Wu Waleed Meleis

Source URL: teamcore.usc.edu

Eight Friends Are Enough: Social Graph Approximation via Public Listings Joseph Bonneau Jonathan Anderson

Source URL: www.jbonneau.com

An O(k 3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design Julia Chuzhoy∗ Sanjeev Khanna†

Source URL: ttic.uchicago.edu

A Theory of Indirection via Approximation Aquinas Hobor ∗† Robert Dockins† Andrew W. Appel †

Source URL: www.comp.nus.edu.sg