1016 search results - page 136 / 204 » Generalized distances between rankings |
100
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we propose a new system extracting potentially copyright infringement texts from the Web, called EPCI. EPCI extracts them in the following way: (1) generating a set...
139
click to vote
WWW
2006
ACM
16 years 2 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
121
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
XML query languages use directional path expressions to locate data in an XML data collection. They are tightly coupled to the structure of a data collection, and can fail when ev...
152
click to vote
ICDM
2006
IEEE
15 years 7 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
SIGIR
2006
ACM
15 years 7 months ago
2006
ACM
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...