Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
Victor Kostyuk, Darren A. Narayan, Victoria A. Wil...
Machine-learned ranking techniques automatically learn a complex document ranking function given training data. These techniques have demonstrated the effectiveness and flexibilit...
Jing Bai, Fernando Diaz, Yi Chang, Zhaohui Zheng, ...
Abstract. Accuracy of current automatic image labeling methods is under the requirements of annotation-based image retrieval systems. The performance of most of these labeling meth...
Abstract We argue that in the decision making process required for selecting assertible vague descriptions of an object, it is practical that communicating agents adopt an epistemi...
This paper is concerned with rank aggregation, the task of combining the ranking results of individual rankers at meta-search. Previously, rank aggregation was performed mainly by...
Yu-Ting Liu, Tie-Yan Liu, Tao Qin, Zhiming Ma, Han...