Suchergebnisse - (encoding OR decoding) (algorithmssics OR (Algorithms OR (Algorithms OR algorithmicsicics)))

Height-bounded Lempel-Ziv encodings von Bannai, Hideo, Funakoshi, Mitsuru, Hendrian, Diptarama, Matsuda, Myuji, Puglisi, Simon J.

Inhaltsangabe: “… We introduce height-bounded LZ encodings (LZHB), a new family of compressed representations …”
Volltext

Adaptive encodings for small and fast compressed suffix arrays von Díaz-Domínguez, Diego, Mäkinen, Veli

Inhaltsangabe: “… ), an encoding technique for BWT-based CSAs that adapts the amount of indexing information to local …”
Volltext

Tight bounds for stream decodable error-correcting codes von Gupta, Meghal, Guruswami, Venkatesan, Singhal, Mihir

Inhaltsangabe: “… code to encode her message $x$ into a codeword. The receiver (Bob) decodes it correctly whenever …”
Volltext

Space-efficient SLP encoding for $O(\log N)$-time random access von Takasaka, Akito, I, Tomohiro

Inhaltsangabe: “… to encode $G$ in $n \lceil \lg N \rceil + (n + n') \lceil \lg (n+σ) \rceil + 4n - 2n' + o(n)$ bits …”
Volltext

Generalized matching decoders for 2D topological translationally-invariant codes von Tan, Shi Jie Samuel, Gill, Ian, Huang, Eric, Liu, Pengyu, Zhao, Chen, Dehghani, Hossein, Kubica, Aleksander, Zhou, Hengyun, Dua, Arpit

Inhaltsangabe: “… . For such codes to be practically relevant, their decoders must successfully correct the most likely errors while …”
Volltext

Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla von Chakraborty, Shantanav, Hazra, Soumyabrata, Li, Tongyang, Shao, Changpeng, Wang, Xinzhao, Zhang, Yuxin

Inhaltsangabe: “… of QSVT rely on block encoding, incurring an intrinsic $O(\log L)$ ancilla overhead and circuit depth …”
Volltext

Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem von Zhong, Dawei, Francis, Akhil, Rrapaj, Ermal

Inhaltsangabe: “… deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block encoding …”
Volltext

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions von Oum, Sang-il, Sokołowski, Marek

Schlagworte: “… Data Structures and Algorithms …”
Volltext

Error Correction for Message Streams von Gupta, Meghal, Zhang, Rachel Yun

Inhaltsangabe: “… where Bob is a low space decoder. More precisely, he receives Alice's encoding $\text{enc}(x)$ bit …”
Volltext

HybHuff: Lossless Compression for Hypergraphs via Entropy-Guided Huffman-Bitwise Coordination von Zhao, Tianyu, Zhao, Dongfang, Guo, Luanzheng, Tallent, Nathan

Inhaltsangabe: “… adaptively combines Huffman encoding and bitwise encoding to exploit structural redundancy. We provide a …”
Volltext

Where to Split and When to Charge: Optimal Route Construction from Customer Permutations in Electric Vehicle Routing von Uroić, Leon Stjepan, Đurasević, Marko

Inhaltsangabe: “… feasible vehicle routes: they must be decoded by choosing where to split the permutation into routes …”
Volltext

Towards Settling the Complexity of the Lettericity Problem von Grobler, Mario, Morawietz, Nils, Sacher, Silas Cato

Inhaltsangabe: “… $ such that there is a word $w_1 \dots w_{|V|} \in Σ^*$ and a decoder $\mathcal{D} \subseteq Σ^2$ with the property …”
Volltext

The Trie Measure, Revisited von Alanko, Jarno N., Becker, Ruben, Cenzato, Davide, Gagie, Travis, Kim, Sung-Hwan, Kodric, Bojana, Prezza, Nicola

Inhaltsangabe: “… encoding $enc : U \rightarrow \{0,1\}^+$ minimizing the so-called trie measure, i.e., the total number …”
Volltext

Succinct Planar Encoding with Minor Operations von Kammer, Frank, Meintrup, Johannes

Inhaltsangabe: “… succinct encoding of $G$ that provides induced-minor operations, i.e., edge contractions and vertex …”
Volltext

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings von Elberfeld, Michael, Kammer, Frank, Meintrup, Johannes

Inhaltsangabe: “… . We present a succinct encoding of separable graphs $G$ such that any number of depth-first searches …”
Volltext

Encodings for Range Minimum Queries over Bounded Alphabets von Jo, Seungbum, Satti, Srinivasa Rao

Inhaltsangabe: “… are used. In this paper, we investigate the encoding complexity of RMQs on arrays over bounded alphabet. We …”
Volltext

Compressed Dictionary Matching on Run-Length Encoded Strings von Bille, Philip, Gørtz, Inge Li, Puglisi, Simon J., Tarnow, Simon R.

Inhaltsangabe: “… using run-length encoding, and the goal is to solve the problem without decompression and achieve …”
Volltext

Semirandom Planted Clique and the Restricted Isometry Property von Błasiok, Jarosław, Buhai, Rares-Darius, Kothari, Pravesh K., Steurer, David

Inhaltsangabe: “… We give a simple, greedy $O(n^{ω+0.5})=O(n^{2.872})$-time algorithm to list-decode planted cliques …”
Volltext

On Finding $\ell$-th Smallest Perfect Matchings von Maalouly, Nicolas El, Haslebacher, Sebastian, Taubner, Adrian, Wulf, Lasse

Inhaltsangabe: “… variants. The EWPM problem is famous, since in the case of unary encoded weights, Mulmuley, Vazirani …”
Volltext

The Communication Complexity of Pattern Matching with Edits Revisited von Kociumaka, Tomasz, Nogler, Jakob, Wellnitz, Philip

Inhaltsangabe: “… an alphabet $Σ$, our recent work [STOC'24] gives an $O(n/m \cdot k \log m \log(m|Σ|))$-bit encoding …”
Volltext