Advanced Search
Now showing items 1-10 of 68
RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy
(Institute of Electrical and Electronics Engineers Inc., 2019)
Fast in-memory XPath search using compressed indexes
(Wiley-Blackwell, 2015)
Space-efficient data-analysis queries on grids
(Elsevier, 2013)
New Space / Time Tradeo s for Top- k Document Retrieval on Sequences
(Elsevier, 2014)
Maximum-Weight Planar Boxes in O(n 2 ) Time (and Better)
(Elsevier, 2013)
Word-Based Self-Indexes for Natural Language Text
(ASSOC COMPUTING MACHINERY, 2012-02)
XXS: Efficient XPath Evaluation on Compressed XML Documents
(ACM, 2014-06)
Entropy-bounded representation of point grids
(Elsevier, 2014)