Следене
Matthias Petri
Matthias Petri
Computing and Information Systems, University of Melbourne
Потвърден имейл адрес: unimelb.edu.au
Заглавие
Позовавания
Позовавания
Година
From theory to practice: Plug and play with succinct data structures
S Gog, T Beller, A Moffat, M Petri
International Symposium on Experimental Algorithms, 326-337, 2014
3892014
Optimized succinct data structures for massive data
S Gog, M Petri
Software: Practice and Experience 44 (11), 1287-1314, 2014
992014
Exploring the magic of WAND
M Petri, JS Culpepper, A Moffat
Proceedings of the 18th Australasian Document Computing Symposium, 58-65, 2013
402013
Efficient in-memory top-k document retrieval
JS Culpepper, M Petri, F Scholer
Proceedings of the 35th international ACM SIGIR conference on Research and …, 2012
352012
CC-News-En: A large English news corpus
J Mackenzie, R Benham, M Petri, JR Trippas, JS Culpepper, A Moffat
Proceedings of the 29th ACM International Conference on Information …, 2020
302020
Compressing inverted indexes with recursive graph bisection: A reproducibility study
J Mackenzie, A Mallia, M Petri, JS Culpepper, T Suel
European Conference on Information Retrieval, 339-352, 2019
232019
Index compression using byte-aligned ANS coding and two-dimensional contexts
A Moffat, M Petri
Proceedings of the Eleventh ACM International Conference on Web Search and …, 2018
212018
Fast dictionary-based compression for inverted indexes
GE Pibiri, M Petri, A Moffat
Proceedings of the Twelfth ACM International Conference on Web Search and …, 2019
202019
ANS-based index compression
A Moffat, M Petri
Proceedings of the 2017 ACM on Conference on Information and Knowledge …, 2017
202017
Effective construction of relative Lempel-Ziv dictionaries
K Liao, M Petri, A Moffat, A Wirth
Proceedings of the 25th International Conference on World Wide Web, 807-816, 2016
202016
Accelerated query processing via similarity score prediction
M Petri, A Moffat, J Mackenzie, JS Culpepper, D Beck
Proceedings of the 42nd International ACM SIGIR Conference on Research and …, 2019
182019
Compact, efficient and unlimited capacity: Language modeling with compressed suffix trees
E Shareghi, M Petri, G Haffari, T Cohn
Proceedings of the 2015 Conference on Empirical Methods in Natural Language …, 2015
162015
Score-safe term-dependency processing with hybrid indexes
M Petri, A Moffat, JS Culpepper
Proceedings of the 37th international ACM SIGIR conference on Research …, 2014
162014
Fixed block compression boosting in FM-indexes: theory and practice
S Gog, J Kärkkäinen, D Kempa, M Petri, SJ Puglisi
Algorithmica 81 (4), 1370-1391, 2019
142019
Compact inverted index storage using general‐purpose compression libraries
M Petri, A Moffat
Software: Practice and Experience 48 (4), 974-982, 2018
122018
Fast, small and exact: Infinite-order language modelling with compressed suffix trees
E Shareghi, M Petri, G Haffari, T Cohn
Transactions of the Association for Computational Linguistics 4, 477-490, 2016
122016
Practical variable length gap pattern matching
J Bader, S Gog, M Petri
International Symposium on Experimental Algorithms, 1-16, 2016
102016
Faster, minuter
S Gog, J Kärkkäinen, D Kempa, M Petri, SJ Puglisi
2016 Data Compression Conference (DCC), 53-62, 2016
92016
Faster index reordering with bipartite graph partitioning
J Mackenzie, M Petri, A Moffat
Proceedings of the 44th International ACM SIGIR Conference on Research and …, 2021
82021
From theory to practice: Plug and play with succinct data structures. InSymposium on Experimental Algorithms (SEA)
S Gog, T Beller, A Moffat, M Petri
DOI 10, 978-3, 2014
82014
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20