|
|
| Line 16: |
Line 16: |
| | == Papers for discussion == | | == Papers for discussion == |
| | | | |
| - | === Recently Seen on Arxiv ===
| + | * [[AFLB/papers|Papers]] |
| - | * [http://arxiv.org/abs/1002.2259 Constructive Algorithms for Discrepancy Minimization]. Nikhil Bansal. | + | |
| - | * [http://arxiv.org/abs/1005.4033 (1005.4033) Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity]. Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak
| + | |
| - | * [http://arxiv.org/abs/1005.2724 (1005.2724) Low Rank Matrix-Valued Chernoff Bounds and Applications]. Avner Magen, Anastasios Zouzias
| + | |
| - | * [http://arxiv.org/abs/0907.1054 (0907.1054) Learning Gaussian Mixtures with Arbitrary Separation]. Mikhail Belkin, Kaushik Sinha
| + | |
| - | * [http://arxiv.org/abs/1005.1122 (1005.1122) Estimating small frequency moments of data stream: a characteristic function approach]. Sumit Ganguly, Purushottam Kar
| + | |
| - | * [http://arxiv.org/abs/1005.1120 (1005.1120) Estimating small moments of data stream in nearly optimal space-time]. Sumit Ganguly
| + | |
| - | * [http://arxiv.org/abs/1005.0982 (1005.0982) Incidences in Three Dimensions and Distinct Distances in the Plane]. György Elekes, Micha Sharir
| + | |
| - | * [http://arxiv.org/abs/1005.0921 (1005.0921) No embedding of the automorphisms of a topological space into a compact metric space endows them with a composition that passes to the limit]. Patrizio Frosini, Claudia Landi
| + | |
| - | * [http://arxiv.org/abs/1004.5049 (1004.5049) The Burbea-Rao and Bhattacharyya centroids]. Frank Nielsen, Sylvain Boltz
| + | |
| - | * [http://arxiv.org/abs/1004.4223 (1004.4223) Settling the Polynomial Learnability of Mixtures of Gaussians]. Ankur Moitra, Gregory Valiant
| + | |
| - | * [http://arxiv.org/abs/1004.3486 (1004.3486) Convergent discrete Laplace-Beltrami operators over surfaces]. Jyh-Yang Wu, Mei-Hsiu Chi, Sheng-Gwo Chen
| + | |
| - | * [http://arxiv.org/abs/1004.3018 (1004.3018) The Convex Hull of a Variety]. Kristian Ranestad, Bernd Sturmfels
| + | |
| - | * [http://arxiv.org/abs/1004.2958 (1004.2958) On the Fermat-Weber Point of a Polygonal Chain]. Bhaswar B. Bhattacharya
| + | |
| - | * [http://arxiv.org/abs/1005.2638 (1005.2638) Hierarchical Clustering for Finding Symmetries and Other Patterns in Massive, High Dimensional Datasets]. Fionn Murtagh, Pedro Contreras
| + | |
| - | * [http://arxiv.org/abs/1005.0188 (1005.0188) Generative and Latent Mean Map Kernels]. Nishant A. Mehta, Alexander G. Gray
| + | |
| - | * [http://arxiv.org/abs/1005.3292 (1005.3292) Optimization of Surface Registrations using Beltrami Holomorphic Flow]. L.M. Lui, T.W. Wong, W. Zeng, X.F. Gu, P.M. Thompson, T.F. Chan, S.T. Yau
| + | |
| - | * [http://arxiv.org/abs/1005.5462 (1005.5462) On the clustering aspect of nonnegative matrix factorization]. Andri Mirzal, Masashi Furukawa
| + | |
| - | * [http://arxiv.org/abs/1005.5513 (1005.5513) Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform]. Nir Ailon, Edo Liberty
| + | |
| - | * [http://arxiv.org/abs/1006.1288 (1006.1288) Regression on fixed-rank positive semidefinite matrices: a Riemannian approach]. Gilles Meyer, Silvere Bonnabel, Rodolphe Sepulchre
| + | |
| - | ** [http://arxiv.org/abs/0807.4462 (0807.4462) Riemannian Metric and Geometric Mean for Positive Semidefinite Matrices of Fixed Rank]. Silvere Bonnabel, Rodolphe Sepulchre
| + | |
| - | | + | |
| - | | + | |
| - | * [http://eccc.hpi-web.de/report/2010/072 Constructive Proofs of Concentration Bounds]. Russell Impagliazzo, Valentine Kabanets
| + | |
| - | * [http://www.ifaamas.org/Proceedings/aamas2010/pdf/01%20Full%20Papers/07_03_FP_0104.pdf On the Role of Distances in Defining Voting Rules]
| + | |
| - | | + | |
| - | === STOC 2010 ===
| + | |
| - | Add papers here that you found interesting (and link to full version if available)
| + | |
| - | | + | |
| - | * Efficiently Learning Mixtures of Two Gaussians. Adam Tauman Kalai (Microsoft), Ankur Moitra (MIT), and Gregory Valiant (UC Berkeley)
| + | |
| - | * [http://arxiv.org/abs/0903.0034 Measuring Independence of Datasets]. Vladimir Braverman and Rafail Ostrovsky (UCLA)
| + | |
| - | * [http://arxiv.org/abs/0907.3754 On the Geometry of Differential Privacy]. Moritz Hardt (Princeton University) and Kunal Talwar (Microsoft Research)
| + | |
| - | * Weighted Geometric Set Cover via Quasi-Uniform Sampling. Kasturi Varadarajan (University of Iowa)
| + | |
| - | * A Sparse Johnson-Lindenstrauss Transform. Anirban Dasgupta and Ravi Kumar and Tamas Sarlos (Yahoo! Research)
| + | |
| - | | + | |
| - | === Other Papers ===
| + | |
| - | | + | |
| - | * [http://www.siam.org/proceedings/soda/2009/SODA09_047_chazelleb.pdf Natural Algorithms] ([http://arxiv.org/abs/0905.4241 this one] might be easier to read) (Chazelle, SODA 09 Best paper)
| + | |
| - | * [http://arxiv.org/abs/0903.0544 A constructive proof of the general Lovasz Local Lemma] (Moser, earlier version STOC 09 Best Student Paper)
| + | |
| - | * [http://portal.acm.org/citation.cfm?id=1536414.1536474 Affiliation Networks] (Lattanzi, Sivakumar, STOC 09)
| + | |
| - | * [http://arxiv.org/abs/0910.3376 Quantum Proofs for Classical Theorems] (Drucker, Wolf)
| + | |
| - | * [http://repository.upenn.edu/cis_reports/123/ Unique games survey] (Harb)
| + | |
| - | * Sorting and Selection with Imprecise Comparisons (Ajtai, Feldman, Hassidim, Nelson, ICALP 09)
| + | |
| - | * [http://compgeom.cs.uiuc.edu/~jeffe//pubs/surflow.html Homology Flows, Cohomology Cuts] (Chambers, Erickson and Nayyeri, STOC 09)
| + | |
| - | * [http://homepages.cwi.nl/~monique/files/lasserrefinal.ps A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming]. Monique Laurent. Mathematics of Operations Research, Vol. 28, No. 3 (May, 2003), pp. 470-496
| + | |
| | | | |
| | ==Previous Semesters == | | ==Previous Semesters == |
If you are interested in giving a talk at AFLB or have questions, please feel free to send a mail to moeller@cs.utah.edu, praman@cs.utah.edu or avishek@cs.utah.edu. If you are planning to give a talk, we would really appreciate if you have an abstract ready a week before the talk is scheduled.
