7215 search results - page 78 / 1443 » On the Consistency of Ranking Algorithms |
JMLR
2012
11 years 10 months ago
2012
We propose a simple and efficient modification of the popular DBSCAN clustering algorithm. This modification is able to detect the most interesting vertical threshold level in a...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Learning Villages (LV) is an E-learning platform for people's online discussions and frequently citing postings of one another. In this paper, we propose a novel method to ra...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
AAAI
2004
13 years 9 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...