4972 search results - page 44 / 995 » Ranking on graph data |
101
click to vote
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
139
click to vote
SIGIR
2012
ACM
13 years 2 months ago
2012
ACM
In this paper, we propose a novel top-k learning to rank framework, which involves labeling strategy, ranking model and evaluation measure. The motivation comes from the difficul...
152
click to vote
SIGIR
2011
ACM
14 years 2 months ago
2011
ACM
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
115
click to vote
ICOIN
2007
Springer
15 years 6 months ago
2007
Springer
Exploring topological structure at Autonomous System (AS) level is indispensable for understanding most issues in Internet services. Previous models of AS graph involve address or ...
CAV
2009
Springer
16 years 11 days ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...