3 papers
cs.DC2016
Efficient Parallel Algorithms for k-Center Clustering
Jessica McClintock, Anthony Wirth
The k-center problem is one of several classic NP-hard clustering questions. For contemporary massive data sets, RAM-based algorithms become impractical. And although there exist g…
cs.IT2016
Access Time Tradeoffs in Archive Compression
Matthias Petri, Alistair Moffat, P. C. Nagesh +1
Web archives, query and proxy logs, and so on, can all be very large and highly repetitive; and are accessed only sporadically and partially, rather than continually and holistical…
cs.DS2013
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays
Simon Gog, Alistair Moffat, J. Shane Culpepper +2
The suffix array is an efficient data structure for in-memory pattern search. Suffix arrays can also be used for external-memory pattern search, via two-level structures that use a…