540 search results - page 10 / 108 » Ranking with Uncertain Scores |
PDP
2006
IEEE
15 years 3 months ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
SSDBM
2006
IEEE
15 years 3 months ago
2006
IEEE
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
Ranking methods like PageRank assess the importance of Web pages based on the current state of the rapidly evolving Web graph. The dynamics of the resulting importance scores, how...
106
click to vote
IWPEC
2010
Springer
14 years 7 months ago
2010
Springer
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
121
click to vote
DASFAA
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...