Space-Efficient Framework for Top-k String Retrieval Problems (extended abstract)
View/ Open
Issue Date
2009Author
Hon, Wing-Kai
Shah, Rahul
Vitter, Jeffrey Scott
Publisher
IEEE
Type
Article
Article Version
Scholarly/refereed, author accepted manuscript
Metadata
Show full item recordAbstract
Given a set D = fd1; d2;
Description
(c) 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Collections
Citation
W.-K. Hon, R. Shah, and J. S. Vitter. “Space-Efficient Framework for Top-k String Retrieval Problems,” in preparation. An extended abstract appears in Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS ’09), Atlanta, GA, October 2009, 713–722. http://dx.doi.org/10.1109/FOCS.2009.19
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.