Risultati della ricerca - (deencoding OR encoding) (algorithmics OR (Algorithms OR (algorithmicsics OR Algorithms)))

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

Sommario: “...We introduce height-bounded LZ encodings (LZHB), a new family of compressed representations...”
Testo

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

Sommario: “...), an encoding technique for BWT-based CSAs that adapts the amount of indexing information to local...”
Testo

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

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

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

Sommario: “...Graphs provide a natural way to represent data by encoding information about objects...”
Testo

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

Sommario: “...We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework...”
Testo

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

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

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

Sommario: “... recent imaginary time algorithm, which requires no variational parameter optimization as all parameters...”
Testo

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

Sommario: “... across many fields of science, and there is increasing effort to develop quantum linear solver algorithms...”
Testo

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

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

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

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

Modulating electrocardiographic signals with chaotic algorithms di E. Barbara

Sommario: “...Modulating electrocardiographic signals with chaotic algorithms E. Barbara E. Alba O. Rodríguez...”
Testo

Practical Guide to Quantum Computing – Variational Algorithms: Cost Functions (Based on Materials from IBM Q) # 4 di Pavlov, Mikhail

Sommario: “... on the evaluation and implementation of cost functions in variational quantum algorithms (VQAs), based on IBM Q...”
Testo

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

Sommario: “... that find the value of $a$ minimizing the trie measure when this encoding is used. Our two algorithms run...”
Testo

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

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

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

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

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

Sommario: “... construction algorithm takes $O(r\log r)$-time. In this paper, we describe a construction algorithm achieving...”
Testo

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

Sommario: “... using run-length encoding, and the goal is to solve the problem without decompression and achieve...”
Testo

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

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

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

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

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

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