Advertisement

Pictures from Mongolia – Partial Sorting in a Partial World

  • Paolo Boldi
  • Flavio Chierichetti
  • Sebastiano Vigna
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4475)

Abstract

You are back from that very long, marvelous journey. You have a thousand pictures, but your friends and relatives will stand just a few dozens. Choosing is a painful process, in particular when you cannot decide between the silent vastity of that desert and the idyllic picture of that tranquil, majestic lake. We are going to help.

Keywords

Partial Order Interesting Node Linear Order Maximal Element Probabilistic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cowan, T., Fishburn, P.: Foundations of preference. In: Essays in Honor of Werner Leinfellner. Reidel, D., Dordrecht, pp. 261–271 (1988)Google Scholar
  2. 2.
    Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: WWW ’01: Proceedings of the 10th international conference on World Wide Web, pp. 613–622. ACM Press, New York (2001)CrossRefGoogle Scholar
  3. 3.
    Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: SIGMOD ’03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 301–312. ACM Press, New York (2003)CrossRefGoogle Scholar
  4. 4.
    Kleitman, D., Rothschild, B.L.: Asymptotic enumeration of partial orders on a finite set. Trans. of the American Mathematical Society 205, 205–220 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Chvátal, V.: The tail of the hypergeometric distribution. Discrete Mathematics 25(3), 285–287 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Dubhashi, D.D., Panconesi, A.: Concentration of measure for the analysis of randomised algorithms (October 1998) Draft available at: http://www.dsi.uniroma1.it/~ale/papers.html

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Paolo Boldi
    • 1
  • Flavio Chierichetti
    • 2
  • Sebastiano Vigna
    • 1
  1. 1.Dipartimento di Scienze dell’Informazione, Università degli Studi di MilanoItalia
  2. 2.Dipartimento di Informatica, Università di Roma “La Sapienza”Italia

Personalised recommendations