Suchergebnisse - (encoding OR decoding) (Algorithms OR (algorithmssic OR algorithmssssic))

  1. 1

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

    Veröffentlicht 2024
    Inhaltsangabe: “… We introduce height-bounded LZ encodings (LZHB), a new family of compressed representations …”
    Volltext
    Preprint
  2. 2

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

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

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

    Veröffentlicht 2026
    Inhaltsangabe: “… ), an encoding technique for BWT-based CSAs that adapts the amount of indexing information to local …”
    Volltext
    Preprint
  4. 4

    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

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

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

    Veröffentlicht 2024
    Inhaltsangabe: “… to encode $G$ in $n \lceil \lg N \rceil + (n + n') \lceil \lg (n+σ) \rceil + 4n - 2n' + o(n)$ bits …”
    Volltext
    Preprint
  6. 6

    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

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

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

    Veröffentlicht 2024
    Inhaltsangabe: “… deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block encoding …”
    Volltext
    Preprint
  8. 8
  9. 9

    Inference in Normal Form: Unifying LLM Tricks via TRoT von Takahashi, K

    Veröffentlicht 2025
    Inhaltsangabe: “… -time</em> methods for large language models (LLMs)—e.g., <strong>MBR/eMBR decoding …”
    Volltext
    Recurso digital
  10. 10

    Hybridizing Target- and SHAP-encoded Features for Algorithm Selection in Mixed-variable Black-box Optimization von Dietrich, Konstantin, Prager, Raphael Patrick, Doerr, Carola, Trautmann, Heike

    Veröffentlicht 2024
    Inhaltsangabe: “… was addressed in a recent study that uses an approach based on target-encoding to compute exploratory landscape …”
    Volltext
    Preprint
  11. 11

    Quantum-enhanced belief propagation for LDPC decoding von Perez-Garcia, Sheila M., Montanaro, Ashley

    Veröffentlicht 2024
    Inhaltsangabe: “… for fast decoding due to the low density of these codes. However, there is scope for improvement …”
    Volltext
    Preprint
  12. 12

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

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

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

    Veröffentlicht 2025
    Inhaltsangabe: “… adaptively combines Huffman encoding and bitwise encoding to exploit structural redundancy. We provide a …”
    Volltext
    Preprint
  14. 14

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

    Veröffentlicht 2026
    Inhaltsangabe: “… feasible vehicle routes: they must be decoded by choosing where to split the permutation into routes …”
    Volltext
    Preprint
  15. 15

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

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

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

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

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

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

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

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

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

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

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

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