Suchergebnisse - encoding (algorithmics OR (Algorithms OR ((algorithmssics OR Algorithms) OR Algorithms)))

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

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

A customizable inexact subgraph matching algorithm for attributed graphs von Benko, Tatyana, Jones, Rebecca, Tate, Lucas

Inhaltsangabe: “… Graphs provide a natural way to represent data by encoding information about objects …”
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: “… We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework …”
Volltext

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs von Jennings, David, Lostaglio, Matteo, Pallister, Sam, Sornborger, Andrew T, Subaşı, Yiğit

Inhaltsangabe: “… across many fields of science, and there is increasing effort to develop quantum linear solver algorithms …”
Volltext

Quantum algorithms for spectral sums von Luongo, Alessandro, Shao, Changpeng

Inhaltsangabe: “… and quadratic in the estimation error. Assuming access to a block-encoding of a matrix, our algorithms are sub …”
Volltext

Quantum linear system algorithm with optimal queries to initial state preparation von Low, Guang Hao, Su, Yuan

Inhaltsangabe: “… Quantum algorithms for linear systems produce the solution state $A^{-1}|b\rangle$ by querying two …”
Volltext

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

Inhaltsangabe: “… recent imaginary time algorithm, which requires no variational parameter optimization as all parameters …”
Volltext

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

Inhaltsangabe: “… )=k$. We also give an algorithm that constructs this representation in time $O(n^{2k+7}γ+n^{2k+8}+n^{4 …”
Volltext

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

Inhaltsangabe: “… that find the value of $a$ minimizing the trie measure when this encoding is used. Our two algorithms run …”
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

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

Inhaltsangabe: “… via an encoding $\text{enc}(x)$ that is resilient to error. In this work, we investigate the scenario …”
Volltext

Optimal-Time Move Structure Construction von Brown, Nathaniel K., Sanaullah, Ahsan, Zhang, Shaojie, Langmead, Ben

Inhaltsangabe: “… construction algorithm takes $O(r\log r)$-time. In this paper, we describe a construction algorithm achieving …”
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

Binary $k$-Center with Missing Entries: Structure Leads to Tractability von Soheil, Farehe, Simonov, Kirill, Friedrich, Tobias

Inhaltsangabe: “… . Formally, we show fixed-parameter tractable algorithms for the parameters vertex cover, fracture number …”
Volltext

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines von Rohwedder, Lars

Inhaltsangabe: “… present an algorithm that solves the problem in time $p_{\max}^{O(d)} n^{O(1)}$, where $p_{\max …”
Volltext

Canonical Labeling of Latin Squares in Average‐Case Polynomial Time von Michael J. Gill, Adam Mammoliti, Ian M. Wanless

Inhaltsangabe: “… Ian M. Wanless Random Structures & Algorithms ABSTRACTA Latin square of order is an matrix in which …”
Volltext

Longest Unbordered Factors on Run-Length Encoded Strings von Sekizaki, Shoma, Mieno, Takuya

Inhaltsangabe: “… subquadratic and near-linear time algorithms for this problem, the best known worst-case time complexity …”
Volltext

Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation von Hatzel, Meike, Jaffke, Lars, Lima, Paloma T., Masařík, Tomáš, Pilipczuk, Marcin, Sharma, Roohani, Sorge, Manuel

Inhaltsangabe: “… (with a randomized algorithm). This problem, given a directed graph $G$, pairs of vertices (called …”
Volltext