Sorting from Noisier Samples
暂无分享,去创建一个
[1] Alan M. Frieze,et al. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[2] Jeff A. Bilmes,et al. Consensus ranking under the exponential model , 2007, UAI.
[3] Mark Braverman,et al. Sorting from Noisy Information , 2009, ArXiv.
[4] Joseph Naor,et al. Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs , 1995, IPCO.
[5] M. Trick,et al. Voting schemes for which it can be difficult to tell who won the election , 1989 .
[6] Marek Karpinski,et al. Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems , 2009, APPROX-RANDOM.
[7] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[8] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[9] Craig Boutilier,et al. Effective sampling and learning for mallows models with pairwise-preference data , 2014, J. Mach. Learn. Res..
[10] Ronald L. Graham,et al. Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.
[11] Ariel D. Procaccia,et al. A Maximum Likelihood Approach For Selecting Sets of Alternatives , 2012, UAI.
[12] Nir Ailon,et al. An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity , 2010, J. Mach. Learn. Res..
[13] Noga Alon,et al. Ranking Tournaments , 2006, SIAM J. Discret. Math..
[14] C. L. Mallows. NON-NULL RANKING MODELS. I , 1957 .
[15] Narges Simjour. Improved Parameterized Algorithms for the Kemeny Aggregation Problem , 2009, IWPEC.
[16] Silvio Lattanzi,et al. On Reconstructing a Hidden Permutation , 2014, APPROX-RANDOM.
[17] Mark Braverman,et al. Noisy sorting without resampling , 2007, SODA '08.
[18] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[19] Alan M. Frieze,et al. Quick Approximation to Matrices and Applications , 1999, Comb..
[20] Eli Upfal,et al. Computing with Noisy Information , 1994, SIAM J. Comput..
[21] Rolf Niedermeier,et al. Fixed-parameter algorithms for Kemeny rankings , 2009, Theor. Comput. Sci..
[22] Claire Mathieu,et al. Electronic Colloquium on Computational Complexity, Report No. 144 (2006) How to rank with few errors A PTAS for Weighted Feedback Arc Set on Tournaments , 2006 .