Power in unity: forming teams in large-scale community systems
暂无分享,去创建一个
Luca Becchetti | Aristides Gionis | Stefano Leonardi | Carlos Castillo | Aris Anagnostopoulos | A. Gionis | L. Becchetti | S. Leonardi | C. Castillo | A. Anagnostopoulos
[1] Amos Fiat,et al. On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.
[2] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[3] Stefano Leonardi,et al. On-line Network Routing , 1996, Online Algorithms.
[4] M. de Rijke,et al. Determining Expert Profiles (With an Application to Expert Finding) , 2007, IJCAI.
[5] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[6] Paul P. Maglio,et al. Expertise identification using email communications , 2003, CIKM '03.
[7] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[8] P. Kidwell,et al. The mythical man-month: Essays on software engineering , 1996, IEEE Annals of the History of Computing.
[9] Mark S. Ackerman,et al. Expertise networks in online communities: structure and algorithms , 2007, WWW '07.
[10] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.
[11] Jr. Frederick P. Brooks,et al. The mythical man-month (anniversary ed.) , 1995 .
[12] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .
[13] Hongbo Deng,et al. Formal Models for Expert Finding on DBLP Bibliography Data , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[14] Yossi Azar. On-line Load Balancing , 1996, Online Algorithms.
[15] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[16] Ronald L. Graham,et al. Bounds on multiprocessing anomalies and related packing algorithms , 1972, AFIPS '72 (Spring).
[17] M. de Rijke,et al. Formal models for expert finding in enterprise corpora , 2006, SIGIR.
[18] Kurt Mehlhorn,et al. Assigning Papers to Referees , 2009, Algorithmica.
[19] Clay Shirky. Here Comes Everybody: The Power of Organizing Without Organizations , 2008 .
[20] David Hawking,et al. Panoptic Expert: Searching for experts not just for documents , 2001 .
[21] Theodoros Lappas,et al. Finding a team of experts in social networks , 2009, KDD.
[22] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..