- 1.Brian T. Bartell~ Garrison W. Cottrell~ and Richard Ko Belew. Automatic combination of multiple ranked retrievM systems. In Proceedings of the 17th International Conference on Research and Development in Information RetmevaI (SIGIR-9~), July 1994. Google ScholarDigital Library
- 2.N.J. Belkin~ C. Cool~ W.B. Croft~ and J.P. Callan. The effect of multiple query representations on information system performance~ In Robert Korfhage~ Edie Rasmussen~ and Peter Willet~, editors~ Proceedings of the Sixteenth Annual International A CM SIGIR Conference on Research and Development in Information Retrieval~ pages 339-346, June 1993. Google ScholarDigital Library
- 3.N.J. Belkin, P. Kantor, C. Cool, and R~ Quatrain. Query combination and data fusion for information retrieval, in Donna K. Harman~ editor, Proceedings of the Second Text REtrieval Conference (TREC-2), pages 35-449 March 1994. NIST Special{ Publication 500-215.Google Scholar
- 4.Chris Buckley. Implementation of the SMART information retrieval system. Technical Report 85-686, Computer Science Department, Cornell University~ Ithaca, New York, May 1985. Google ScholarDigital Library
- 5.Chris Buckley, Gerard SMton, and James Allan~ Automatic retrieval with locality ~nformation using SMART~ In D. K. Harman, editor, Proceedings of the First Text RE~meval Conference (TREC-i), pages 59-72. NIST Special Publication 500-207, March 1993.Google Scholar
- 6.Susan T. Dumais. LSI meets TREC: A status report. In Donna K. Harman, editor, Proceedings of the First Text REtrieval Conference (TREC-1)~ pages 137-152, March 1993. NIST Special Publication 500-207.Google Scholar
- 7.Edward A. Fox and Joseph A. Shaw. Combination of multiple searches. In Donna K. Harman, editor, Proceedings of the Second Text REtmeval Conference (TREC-$), pages 243-2529 March 1994. NIST Special Publication 500-215.Google Scholar
- 8.Donna Ko Harman. The first Text REtrieval Conference (TREC-1)~ Rockville, MD, U.S.A, 4-6 November, 1992. Information Processing and Management, 29(4):411-414~ 1993. Google ScholarDigital Library
- 9.L. Kaufman and P. Rousseeuw. F~nding Groups in Data An Introduction to Cluster Analysis. Wiley, 1990.Google Scholar
- 10.John W. Kirriemuir and Peter Willett. Identification of duplicate and near-duplicate full-text records in database search-outputs using hierarchic cluster analysis. In Proceedings of the Electronic Library and Visual Information Research Conference~ May 1995. (To appear).Google Scholar
- 11.Richard So Marcus and J. Francis Reintjes. A translating computer interface for end-user operation of heterogeneous retrieval systems, iI. Evaluations. Journal of the American Society for Information Science, 34(6):381-404~ 1983.Google Scholar
- 12.Alistair Moffat and Justin Zobel. Information retrieval systems for large document collections. In Proceedings of the Third Text REtrieval Conference (TREC-3), November 1994. In press.Google Scholar
- 13.Ellen M. Voorhees~ Narendra K. Gupta, and Ben Johnson-Laird. The collection fusion problem. In Proceedings of the Third Text REtrieval Conference (TREC-3), November 1994. In press.Google Scholar
Index Terms
- Learning collection fusion strategies
Recommendations
Age-based garbage collection
Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which clearly are still live. We introduce new garbage collection algorithms, ...
Age-based garbage collection
OOPSLA '99: Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsModern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which clearly are still live. We introduce new garbage collection algorithms, ...
Garbage collection hints
HiPEAC'05: Proceedings of the First international conference on High Performance Embedded Architectures and CompilersThis paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms of when and how to collect. We argue that garbage collection should be done when the amount of live bytes is low (in order to minimize the collection cost)...
Comments