ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03)
Full text PdfPdf (177 KB)
Source
International Conference on Management of Data archive
Proceedings of the 2008 ACM SIGMOD international conference on Management of data table of contents
Vancouver, Canada
SESSION: Corrigendum table of contents
Pages 1375-1376  
Year of Publication: 2008
ISBN:978-1-60558-102-6
Authors
Alexandr Andoni  MIT, Cambridge, MA, USA
Ronald Fagin  IBM Almaden Research Center, San Jose, CA, USA
Ravi Kumar  Yahoo! Research, Sunnyvale, CA, USA
Mihai Patrascu  MIT, Cambridge, MA, USA
D. Sivakumar  Google Inc., Mountain View, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 192,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1376616.1376778
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
Ronald Fagin , Ravi Kumar , D. Sivakumar, Efficient similarity search and classification via rank aggregation, Proceedings of the 2003 ACM SIGMOD international conference on Management of data, June 09-12, 2003, San Diego, California  [doi>10.1145/872757.872795]
2
Piotr Indyk, Stable distributions, pseudorandom generators, embeddings, and data stream computation, Journal of the ACM (JACM), v.53 n.3, p.307-323, May 2006  [doi>10.1145/1147954.1147955]
 
3
W. Johnson and J. Lindenstrauss. Extensions of Lipshitz mapping into Hilbert space. Contemporary Mathematics, 26:189--206, 1984.
 
4
W. Johnson and G. Schechtman. Embedding l moverp into l nover1. Acta Mathematica, 149:71--85, 1982.

INDEX TERMS

Primary Classification:
  E. Data
  E.1 DATA STRUCTURES
      Subjects: Graphs and networks


General Terms:
Algorithms, Theory


Keywords:
median, nearest neighbor, rank aggregation, score aggregation

Collaborative Colleagues:
Alexandr Andoni: colleagues
Ronald Fagin: colleagues
Ravi Kumar: colleagues
Mihai Patrascu: colleagues
D. Sivakumar: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player