Conference paper
Rewrite rules for search database systems
Ronald Fagin, Benny Kimelfeld, et al.
SIGMOD/PODS 2011
Paper
Comparing partial rankings
Abstract
We provide a comprehensive picture of how to compare partial rankings, that is, rankings that allow ties. We propose several metrics to compare partial rankings and prove that they are within constant multiples of each other. © 2006 Society for Industrial and Applied Mathematics.
Related
Ziv Bar-Yossef, Ravi Kumar, et al.
SODA 2002
Miklos Ajtai, Randal Burns, et al.
Journal of the ACM
Conference paper
On the bursty evolution of blogspace
Ravi Kumar, Jasmine Novak, et al.
WWW 2003