Chris Faloutsos
- 1.Aho, A.V. and MJ. Corastck, "Fast Pattern Matchmg: An Aid to Bibliographic Search," Cornmunlcattons ACM, vol. 18, no. 6, pp. 333-340, June 1975. Google Scholar
Digital Library
- 2.Bud, R.M., J.C. Tu, and RM. Worthy, "Associative/Paral1el Processors for Searching Very Large Textual Data Bases," Proc. of the 3rd ACM Workshop on Computer Architecture for Nonnumeric Processing, pp. 8-16, New York, May 1977. Google ScholarDigital Library
- 3.Boyer, R.S. and JS. Moore, "A Fast String Searching Algorithm," CACM, vol. 20, no. 10, pp. 762-772, Oct. 1977. Google ScholarDigital Library
- 4.Christodoulakts, S., "A Framework for the Development of a Muted-Mode Message System for an Office Envtronment ," Proc 3rd Joint ACM-BCS Syniposium on Research and Development in If ormutron Retrreval, Cambridge, 1984. Google ScholarDigital Library
- 5.Chrtstodoulakrs, S. and C. Faloutsos, "Design Considerations for a Message File Server," fEEE Trans. on Software Engineering , vol. SE-IO, no. 2, pp. 281-210, March 1984.Google Scholar
- 6.Dattola, R., "FIRST: Flexible Information Retrieval System for Text," JASfS, vol. 30, pp. 9-14, Jan. 1979.Google Scholar
- 7.Faloutsos, C., "Text Retrieval Methods," ACM Computing Surveys, 1984. submitted for publicat1onGoogle Scholar
- 8.Faloutsos, C. and S. Chrtstodoulakis, "Signature Files: An Access Method for Documents and its Analyttcal Performance Evaluation," ACM Trans. on Office &formation Systems, vol. 2, no. 4, Oct. 1984. Google ScholarDigital Library
- 9.Gallager, R.G. and D.C Van Voorhts, "Optimal Source Codes for Geometrically Distnbuted Integer Alphabets.," IEEE Trans. on Information Theory, vol. IT-21, pp. 228230, March 1975.Google Scholar
- 10.Golomb, S.W., "Run Length Encodings," IEEE Trans on Xn/ormation Theory, vol. IT-12, pp. 399401, July 1966.Google Scholar
- 11.Gravtna, C.M., "Nattonal Westmrnster Bank Mass Storage Archiving," IBM Systems J., vol. 17, no. 4, pp 344-358,1978.Google ScholarDigital Library
- 12.Gustafson, R. A., "Elements of the Random&d Combinatorial File Structure," AClld SIGIR, Proc of the Symposium on lnformutron Storage and Retrieval, pp. 163-174, Univ. of Maryland, Apr. 1971. Google ScholarDigital Library
- 13.Hasktn, R L , "Specral-Purpose Processors for Text Retneval," Database Engineering, vol. 4, no. 1, pp. 16-29, Sept 1981.Google Scholar
- 14.Haskm, R L and RA Lorte, "On Extcndmg the Functions of a Relational Database System," Proc ACM SXGMOD, pp. 207-212, Orlando, Flortda, 1982. Google ScholarDigital Library
- 15.Hollaar, L.A., "Text Rctricval Computers," IEEE Computer Magazine, vol. 12, no. 3, pp. #SO, March 1979.Google Scholar
- 16.Hollaar, LA, K.F. Smith, W.H. Chow, PA. Emrath, and R.L. Haskin, "Architecture and Gpcratron of a Large, Full-Text Information-Retrieval System, '* in Advanced Database Machine Architecture, ed D.K. Hslao, pp 256-299, Prentice-Hall, Englewood Chffs, New Jersey, 1983.Google Scholar
- 17.IBM,, STAIRSIVS Reference Manual, 1979. IBM System ManualGoogle Scholar
- 18.Knuth, D.E., J.H Morris, and V.R. Pratt, "Fast Pattern Matching in Strings," SIAM J. Comput , vol. 6, no. 2, pp. 323-350, June 1977.Google ScholarDigital Library
- 19.Larson, PA., "A method for specdmg up text retneval," Proc. of ACM SIGMOD Conference, San Jose, CA, May 1983. Google ScholarDigital Library
- 20.McIlroy, M.D., "Dcvelopmcnt of a Spelling List," IEEE Trans on Communications, vol. COM-30, no 1, pp. 91-99, Jan. 1982.Google Scholar
- 21.McLeod, 1.A , "A Data Base Management System for Document Retrieval Applications," In/ormatron Systems, vol. 6, no. 2, pp. 131-137,198l.Google ScholarCross Ref
- 22.Mooers, C , "Apphcatton of Random Codes to the Gathering of Statistical Information," Bullettn 31, Zator Co., Cambridge, Mass., 1949. based on MS. thesis, MIT, January 1948Google Scholar
- 23.Pfaltz, J.L., W.H. Berman, and EM. Cagley, "Partial Match Retrieval Using Indexed Descriptor Files," CACM, vol. 23, no. 9, pp. 522-528, Sept. 1980. Google ScholarDigital Library
- 24.Rabltti, F. and J. Zizka, "Evaluation of Access Methods to Text Documents in Office Systems,'* Proc. 3rd Joint ACM-BCS Symposium on Research and Development in In/ormatfon Retrieval, Cambridge, 1984. Google ScholarDigital Library
- 25.Roberts, C-S., "Partial-Match Retrieval via the Method d Superimposed Codes," Proc IEEE, vol 67, no. 12, pp. 16241642, Dec. 1979.Google ScholarCross Ref
- 26.Salton, G , The SMART Retrieval System - Experiments in Automatic Document Processing. Prentice-Hall Inc., Englewood Chffs, New Jersey, 1971. Google ScholarDigital Library
- 27.Salton, G. and M J. McGill, introduction to Modern Znformatfon Retrfevaf, McGraw-Hill, 1983. Google ScholarDigital Library
- 28.Stiassny, S., "Mathemattcal Analysis of Various Superimposed Coding Methods," Amerfcun Documentutlon, vol. 11, no. 2, pp. 155-169, Feb. 1960.Google ScholarCross Ref
- 29.Tstchritzis, D. and S. Christodoulakis, "Message Files," ACM Trans. on Office In/ormatfon Systems, vol. 1, no. 1, pp. 88-98, Jan. 1983. Google ScholarDigital Library
- 30.Tsichrttzis, D., S. Christodoulakis, P. Economopoulos, C. Faloutsos, A. Lee, D. Lee, J. Vandenbroek, and C. Woo, "A Multimedia Office Fig System," Proc 9th International Cot#erence on VLDB, Florence, Italy, Oct.-Nov. 1983. Google ScholarDigital Library
- 31.Van-Ripbergen, CJ., information Retrieval, Butterworths, London, England, 1979. 2nd edition Google ScholarDigital Library
Index Terms
- Signature files: design and performance comparison of some signature extraction methods
Recommendations
Certificateless multi-proxy signature
Multi-proxy signature is a scheme that an original signer authorizes a proxy group as his proxy agent and later only the cooperation of all proxy signers in the proxy group could sign messages on behalf of the original signer. To our best knowledge, ...
Certificateless proxy multi-signature
Proxy multi-signature allows a group of original signers to delegate their signing capabilities to a proxy signer in such a way that the proxy signer can sign messages on behalf of the group of original signers. Existing constructions of proxy multi-...
Provably secure pairing-based convertible undeniable signature with short signature length
Pairing'07: Proceedings of the First international conference on Pairing-Based CryptographyUndeniable signatures, introduced by Chaum and van Antwerpen, is a useful cryptography primitive to limit the publicly verifiable property of ordinary digital signatures. In an undeniable signature scheme, the validity or invalidity of the signature can ...
Comments