4972 search results - page 30 / 995 » Ranking on graph data |
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is...
101
click to vote
WEBI
2005
Springer
15 years 5 months ago
2005
Springer
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
IM
2007
14 years 11 months ago
2007
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
150
click to vote
ECOOP
2003
Springer
15 years 5 months ago
2003
Springer
Despite Java’s automatic reclamation of memory, memory leaks remain an important problem. For example, we frequently encounter memory leaks that cause production servers to crash...
AAAI
2006
15 years 1 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...