We have 6 of 443 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
It is demonstrated that depth-first layouts of $k^2$-trees provide a practical and efficient alternative to traditional layouts, improving both compression and computational performance in matrix operations.
Public software repositories, like GitHub and Software Heritage Archive, store billions of files, yet extracting their implicit engineering knowledge ---i.e., the algorithms they implement, the paradigms they follow, the patterns they instantiate, and the application domains they serve--- remains challenging, as curren...
A practical design that combines Ring ORAM to hide access patterns to outsourced data, with a Patricia trie for space-efficient search over variable-length strings to support search over variable-length string datasets in an ORAM scenario, while retaining efficient storage and access both on the client and the server i...
The first oblivious implementations of Rank and Select that require only a single ORAM access per operation, use O(1) client-side space, and add negligible client computation overhead are presented.
It is argued that replacing autoregressive LLMs with DLMs within the same compression framework could overcome the throughput bottleneck caused by their one-symbol-per-step limitation, and the newly proposed DLM-based framework advances the state of the art in lossless text compression.
This work introduces LLM-based compressors deploying two novel symbol-ranking variants that bound predictions to the top-$T$ ranks, and conducts the first large-scale evaluation of LLM-based source code compression across 30 LLMs, including general-domain, code-specialized, and quantized models.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
