Suchergebnisse - encoding (Algorithm OR Algorithmic)

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

Inhaltsangabe: “… -multiplicity instance encoding.  …”
Volltext

Coupling Bertoin's and Aldous–Pitman's representations of the additive coalescent von Igor Kortchemski, Paul Thévenin

Inhaltsangabe: “… Paul Thévenin Random Structures & Algorithms Abstract We construct a coupling between two seemingly …”
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

String Indexing with Compressed Patterns von Bille, Philip, Gørtz, Inge Li, Steiner, Teresa Anna

Inhaltsangabe: “… structural techniques of independent interest, including a novel data structure that compactly encodes all LZ …”
Volltext

Competitive Search in the Line and the Star with Predictions von Angelopoulos, Spyros

Inhaltsangabe: “… the prediction is in the form of a $k$-bit string which encodes the responses to $k$ binary queries. For the star …”
Volltext

Optimal prefix-suffix queries with applications von Pissis, Solon P.

Inhaltsangabe: “… lemma that lets us encode the output of any query in constant time and space. We also show a new direct …”
Volltext

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

Inhaltsangabe: “… , and treewidth of the row-column graph, which encodes the positions of the known entries of the matrix …”
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

Space-efficient Data Structure for Next/Previous Larger/Smaller Value Queries von Jo, Seungbum, Kim, Geunho

Inhaltsangabe: “… larger/smaller queries) efficiently. In the encoding model (i.e., the queries can be answered without …”
Volltext

Optimal Static Dictionary with Worst-Case Constant Query Time von Hu, Yang, Liang, Jingxun, Yu, Huacheng, Zhang, Junkai, Zhou, Renfei

Inhaltsangabe: “… , the (information-theoretical) optimal space to encode such a set of key-value pairs is only $\text{OPT} := \log …”
Volltext

Testing Sparse Functions over the Reals von Arora, Vipul, Bhattacharyya, Arnab, John, Philips George, Sen, Sayantan

Inhaltsangabe: “… fields, and discrete settings. However, to encode the real-world applications more succinctly, function …”
Volltext

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage von Balakrishnan, Girish, Chakraborty, Sankardeep, Narayanaswamy, N S, Sadakane, Kunihiko

Inhaltsangabe: “… of any data structure that encodes a graph in $\mathcal{G}_k$. Further, for every $k-$vertex leafage …”
Volltext

Indexing Tries within Entropy-Bounded Space von Carfagna, Lorenzo, Tosoni, Carlo

Inhaltsangabe: “… . We use these measures to prove that the XBWT of a trie can be encoded within a space bounded by our k …”
Volltext

Sensitivity of Repetitiveness Measures to String Reversal von Bannai, Hideo, Fujie, Yuto, Guo, Peaker, Inenaga, Shunsuke, Nakashima, Yuto, Puglisi, Simon J., Urbina, Cristian

Inhaltsangabe: “… exhibit an infinite family of strings where the number, $r$, of runs in the run-length encoding …”
Volltext

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

Inhaltsangabe: “… )$-time given the run-length-encoded Burrows-Wheeler transform. Finally, we implement our improved move …”
Volltext

Cut Sparsification and Succinct Representation of Submodular Hypergraphs von Kenneth, Yotam, Krauthgamer, Robert

Inhaltsangabe: “… substantially smaller encoding of the cuts of $H$ (almost a factor $n$ in the number of bits …”
Volltext

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

Inhaltsangabe: “… in the context of compressed string processing, particularly focusing on run-length encoded (RLE) strings. We …”
Volltext

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck von Kuszmaul, William, Liang, Jingxun, Zhou, Renfei

Inhaltsangabe: “… bottleneck, in which the bits needed to encode some dynamic tree structure are themselves enough to force a …”
Volltext

Ultrabubble enumeration via a lowest common ancestor approach von Zisis, Athanasios E., Sætrom, Pål

Inhaltsangabe: “… the graph represents one individual genome. Subgraphs that encode locally distinct paths are therefore …”
Volltext

Scenario-Based Robust Optimization of Tree Structures von Angelopoulos, Spyros, Dürr, Christoph, Elenter, Alex, Melidi, Georgii

Inhaltsangabe: “… for efficiently managing and encoding data based on a known set of frequencies of keys. Given $k$ different …”
Volltext