Sciweavers

2018 search results - page 209 / 404
» Magnitude-preserving ranking algorithms
Sort
View
SPAA
1993
ACM
15 years 10 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
WWW
2009
ACM
16 years 7 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan
ATAL
2007
Springer
16 years 20 days ago
Eliciting single-peaked preferences using comparison queries
Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alter...
Vincent Conitzer
SIGIR
2010
ACM
15 years 10 months ago
Extending average precision to graded relevance judgments
Evaluation metrics play a critical role both in the context of comparative evaluation of the performance of retrieval systems and in the context of learning-to-rank (LTR) as objec...
Stephen E. Robertson, Evangelos Kanoulas, Emine Yi...
AAAI
2006
15 years 8 months ago
Predicting Electricity Distribution Feeder Failures Using Machine Learning Susceptibility Analysis
A Machine Learning (ML) System known as ROAMS (Ranker for Open-Auto Maintenance Scheduling) was developed to create failure-susceptibility rankings for almost one thousand 13.8kV-...
Philip Gross, Albert Boulanger, Marta Arias, David...