540 search results - page 63 / 108 » Ranking with Uncertain Scores |
120
click to vote
PVLDB
2010
14 years 6 months ago
2010
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
124
click to vote
ICWSM
2009
14 years 9 months ago
2009
This paper presents a stochastic graph based method for recommending or selecting a small subset of blogs that best represents a much larger set. within a certain topic. Each blog...
122
click to vote
SSDBM
2005
IEEE
15 years 5 months ago
2005
IEEE
Modern geographic information systems do not only have to handle static information but also dynamically moving objects. Clustering algorithms for these moving objects provide new...
177
click to vote
VLDB
2004
ACM
16 years 1 days ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....