Sparse counting-sets reduce replication overhead in c-regex matching by tracking only essential counter values.
In: Proceedings of the 24th ACM International Conference on Information and Knowledge Management, CIKM 2015, Melbourne, VIC, Australia, October 19 - 23, 2015 , ACM, pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Regex Matching with Sparse Counting-Sets
Sparse counting-sets reduce replication overhead in c-regex matching by tracking only essential counter values.