-
1
-
-
84957608338
-
-
Accessed: 2013-09-01
-
https://github.com/ybenjo/LDA. Accessed: 2013-09-01.
-
-
-
-
2
-
-
84957556246
-
-
Accessed: 2014-11-11
-
lp solve 5.5. http://lpsolve.sourceforge.net/5.5/. Accessed: 2014-11-11.
-
-
-
Lp solve 5.51
-
4
-
-
34748888311
-
Using publications and domain knowledge to build research profiles: An application in automatic reviewer assignment
-
H. K. Biswas and M. Hasan. Using publications and domain knowledge to build research profiles: An application in automatic reviewer assignment. In ICICT, 2007.
-
(2007)
ICICT
-
-
Biswas, H.K.1
Hasan, M.2
-
6
-
-
80053137126
-
A framework for optimizing paper matching
-
L. Charlin, R. S. Zemel, and C. Boutilier. A framework for optimizing paper matching. In UAI, 2011.
-
(2011)
UAI
-
-
Charlin, L.1
Zemel, R.S.2
Boutilier, C.3
-
7
-
-
72249105080
-
Recommender systems for the conference paper assignment problem
-
D. Conry, Y. Koren, and N. Ramakrishnan. Recommender systems for the conference paper assignment problem. In RecSys, 2009.
-
(2009)
RecSys
-
-
Conry, D.1
Koren, Y.2
Ramakrishnan, N.3
-
8
-
-
84957553935
-
-
Accessed: 2014-12-29
-
I. Corp. Ibm cplex cp optimizer 12.6. http://www-01.ibm.com/software/commerce/optimization/cplex-cp-optimizer/index.html. Accessed: 2014-12-29.
-
IBM Cplex Cp Optimizer 12.6
-
-
Corp, I.1
-
10
-
-
0026989461
-
Automating the assignment of submitted manuscripts to reviewers
-
S. T. Dumais and J. Nielsen. Automating the assignment of submitted manuscripts to reviewers. In SIGIR, 1992.
-
(1992)
SIGIR
-
-
Dumais, S.T.1
Nielsen, J.2
-
11
-
-
0032108328
-
A threshold of ln n for approximating set cover
-
July 1998
-
U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634-652, July 1998.
-
J. ACM
, vol.45
, Issue.4
, pp. 634-652
-
-
Feige, U.1
-
13
-
-
84880980719
-
College admissions and the stability of marriage
-
D. Gale and L. S. Shapley. College admissions and the stability of marriage. The American Mathematical Monthly, 120(5):386-391, 2013.
-
(2013)
The American Mathematical Monthly
, vol.120
, Issue.5
, pp. 386-391
-
-
Gale, D.1
Shapley, L.S.2
-
14
-
-
0033272086
-
The conference paper-reviewer assignment problem
-
D. Hartvigsen, J. C. Wei, and R. Czuchlewski. The conference paper-reviewer assignment problem. Decision Sciences, 30(3):865-876, 1999.
-
(1999)
Decision Sciences
, vol.30
, Issue.3
, pp. 865-876
-
-
Hartvigsen, D.1
Wei, J.C.2
Czuchlewski, R.3
-
15
-
-
33749554167
-
Mining for proposal reviewers: Lessons learned at the national science foundation
-
S. Hettich and M. J. Pazzani. Mining for proposal reviewers: lessons learned at the national science foundation. In KDD, 2006.
-
(2006)
KDD
-
-
Hettich, S.1
Pazzani, M.J.2
-
16
-
-
85026972772
-
Probabilistic latent semantic indexing
-
T. Hofmann. Probabilistic latent semantic indexing. In SIGIR, 1999.
-
(1999)
SIGIR
-
-
Hofmann, T.1
-
18
-
-
74549143727
-
Constrained multi-aspect expertise matching for committee review assignment
-
M. Karimzadehgan and C. Zhai. Constrained multi-aspect expertise matching for committee review assignment. In CIKM, 2009.
-
(2009)
CIKM
-
-
Karimzadehgan, M.1
Zhai, C.2
-
19
-
-
70349251896
-
Multi-aspect expertise matching for review assignment
-
M. Karimzadehgan, C. Zhai, and G. G. Belford. Multi-aspect expertise matching for review assignment. In CIKM, 2008.
-
(2008)
CIKM
-
-
Karimzadehgan, M.1
Zhai, C.2
Belford, G.G.3
-
20
-
-
0002719797
-
Variants of the hungarian method for assignment problems
-
H. W. Kuhn. Variants of the hungarian method for assignment problems. Naval Research Logistics Quarterly, 3(4):253-258, 1956.
-
(1956)
Naval Research Logistics Quarterly
, vol.3
, Issue.4
, pp. 253-258
-
-
Kuhn, H.W.1
-
21
-
-
84957549881
-
Automatic paper-to-reviewer assignment, based on the matching degree of the reviewers
-
X. Li and T. Watanabe. Automatic paper-to-reviewer assignment, based on the matching degree of the reviewers. In KES, 2013.
-
(2013)
KES
-
-
Li, X.1
Watanabe, T.2
-
23
-
-
36849008169
-
Expertise modeling for matching papers with reviewers
-
D. M. Mimno and A. McCallum. Expertise modeling for matching papers with reviewers. In KDD, 2007.
-
(2007)
KDD
-
-
Mimno, D.M.1
McCallum, A.2
-
26
-
-
65449166085
-
Arnetminer: Extraction and mining of academic social networks
-
J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su. Arnetminer: extraction and mining of academic social networks. In KDD, 2008.
-
(2008)
KDD
-
-
Tang, J.1
Zhang, J.2
Yao, L.3
Li, J.4
Zhang, L.5
Su, Z.6
-
27
-
-
84875212298
-
Group-to-group reviewer assignment problem
-
F. Wang, S. Zhou, and N. Shi. Group-to-group reviewer assignment problem. Computers & OR, 40(5):1351-1362, 2013.
-
(2013)
Computers & OR
, vol.40
, Issue.5
, pp. 1351-1362
-
-
Wang, F.1
Zhou, S.2
Shi, N.3
-
28
-
-
33749565782
-
Topics over time: A non-markov continuous-time model of topical trends
-
X. Wang and A. McCallum. Topics over time: a non-markov continuous-time model of topical trends. In KDD, 2006.
-
(2006)
KDD
-
-
Wang, X.1
McCallum, A.2
-
29
-
-
84875492193
-
An interval fuzzy ontology based peer review assignment method
-
N. Xue, J.-X. Hao, S. Jia, and Q. Wang. An interval fuzzy ontology based peer review assignment method. In ICEBE, 2012.
-
(2012)
ICEBE
-
-
Xue, N.1
Hao, J.-X.2
Jia, S.3
Wang, Q.4
-
30
-
-
12244251033
-
A cross-collection mixture model for comparative text mining
-
C. Zhai, A. Velivelli, and B. Yu. A cross-collection mixture model for comparative text mining. In KDD, 2004.
-
(2004)
KDD
-
-
Zhai, C.1
Velivelli, A.2
Yu, B.3
|