A Heuristic Method for Document Ranking.

@inproceedings{DBLP:conf/dasfaa/WongL91,
  author    = {Wai Yee Peter Wong and
               Dik Lun Lee},
  editor    = {Akifumi Makinouchi},
  title     = {A Heuristic Method for Document Ranking},
  booktitle = {Database Systems for Advanced Applications '91, Proceedings of
               the Second International Symposium on Database Systems for Advanced
               Applications, Tokyo, Japan, April 2-4, 1991},
  publisher = {World Scientific},
  series    = {Advanced Database Research and Development Series},
  volume    = {2},
  year      = {1991},
  isbn      = {981-02-1055-8},
  pages     = {507-516},
  ee        = {db/conf/dasfaa/WongL91.html},
  crossref  = {DBLP:conf/dasfaa/91},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

References

[1]

Jon Louis Bentley, Bruce W. Weide, Andrew Chi-Chih Yao: Optimal Expected-Time Algorithms for Closest Point Problems. ACM Trans. Math. Softw. 6(4): 563-580(1980) BibTeX

[2]

David C. Blair, M. E. Maron: An Evaluation of Retrieval Effectiveness for a Full-Text Document-Retrieval System. Commun. ACM 28(3): 289-299(1985) BibTeX

[3]

Chris Buckley, A. F. Lewit: Optimization of Inverted Vector Searches. SIGIR 1985: 97-110 BibTeX

[4]

...

[5]

W. Bruce Croft, Pasquale Savino: Implementing Ranking Strategies Using Text Signatures. ACM Trans. Inf. Syst. 6(1): 42-62(1988) BibTeX

[6]

Keinosuke Fukunaga, Patrenahalli M. Narendra: A Branch and Bound Algorithms for Computing k-nearest Neighbors. IEEE Trans. Computers 24(7): 750-753(1975) BibTeX

[7]

...

[8]

...

[9]

...

[10]

...

[11]

Gerard Salton: Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley 1989, ISBN 0-201-12227-8
BibTeX

[12]

Gerard Salton: Another Look at Automatic Text-Retrieval Systems. Commun. ACM 29(7): 648-656(1986) BibTeX

[13]

Gerard Salton, Chris Buckley: Parallel Text Search Methods. Commun. ACM 31(2): 202-215(1988) BibTeX

[14]

Gerard Salton, Edward A. Fox, Harry Wu: Extended Boolean Information Retrieval. Commun. ACM 26(11): 1022-1036(1983) BibTeX

[15]

...

[16]

Alan F. Smeaton, C. J. van Rijsbergen: The Nearest Neighbour Problem in Information Retrieval: An Algorithm Using Upperbounds. SIGIR 1981: 83-87 BibTeX

[17]

Craig Stanfill, Brewster Kahle: Parallel Free-Text Search on the Connection Machine System. Commun. ACM 29(12): 1229-1239(1986) BibTeX

[18]

...

[19]

...

[20]

Gideon Yuval: Finding Nearest Neighbors. Inf. Process. Lett. 5(3): 63-65(1976) BibTeX