Risultati della ricerca - encoding (Algorithm OR Algorithms)

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

Sommario: “... substantially smaller encoding of the cuts of $H$ (almost a factor $n$ in the number of bits...”
Testo

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

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

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

Sommario: “... bottleneck, in which the bits needed to encode some dynamic tree structure are themselves enough to force a...”
Testo

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

Sommario: “... the graph represents one individual genome. Subgraphs that encode locally distinct paths are therefore...”
Testo

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

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

Parameterized Algorithms for the Drone Delivery Problem di Bartlmae, Simon, Hene, Andreas, Könen, Joshua, Röglin, Heiko

Sommario: “... polynomially encodable factor $a(n)$, unless P=NP. Additionally, we identify the intersection graph...”
Testo

Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval di Becht, Matthias, Lehmann, Hans-Peter, Sanders, Peter

Sommario: “... answer membership queries, so it does not have to encode S. The information theoretic space lower bound...”
Testo

Optimal-Time Mapping in Run-Length Compressed PBWT di Bonizzoni, Paola, Cozzi, Davide, Gao, Younan

Sommario: “.... Although the run-length encoded variant of the PBWT (also known as the $μ$-PBWT) achieves $O(\newR)$-word...”
Testo

DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis di Narvaez, Alexander

Sommario: “... principle: each integer key simultaneously encodes its value and its canonical position in the ordered...”
Testo

Random Wheeler Automata di Becker, Ruben, Cenzato, Davide, Kim, Sung-Hwan, Kodric, Bojana, Maso, Riccardo, Prezza, Nicola

Sommario: “... of distinct WDFAs and obtain that $ nσ+ (n - σ) \log σ$ bits are necessary and sufficient to encode a WDFA...”
Testo

Lower Bounds for Matroid Optimization Problems with a Linear Constraint di Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

Sommario: “...), and show that the same results hold when the matroids are encoded as part of the input, assuming $P \neq NP...”
Testo

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding di Hermann, Stefan, Lehmann, Hans-Peter, Pibiri, Giulio Ermanno, Sanders, Peter, Walzer, Stefan

Sommario: “... throughput for space efficient configurations in practice. Our second contribution is a novel encoding scheme...”
Testo

Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries di Kempa, Dominik, Kociumaka, Tomasz

Sommario: “... the array cannot be stored explicitly. The suffix array $SA_T[1..n]$ of a text $T$ of length $n$ encodes...”
Testo

Identifying bubble-like subgraphs in linear-time via a unified SPQR-tree framework di Sena, Francisco, Politov, Aleksandr, Moumard, Corentin, Cairo, Massimo, Rizzi, Romeo, Cáceres, Manuel, Schmidt, Sebastian, Harviainen, Juha, Tomescu, Alexandru I.

Sommario: “... in the graph. We employ the well-known SPQR-tree decomposition, which encodes all 2-separators of a biconnected...”
Testo

Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings di Hammer, Nina, Kammer, Frank, Meintrup, Johannes

Sommario: “... for any fixed graph $H$. This allows us to construct the succinct encoding scheme for $H$-minor-free...”
Testo

Multi-dimensional Approximate Counting di Wang, Dingyu

Sommario: “.... The upper bound is constructed with a certain variable-length integer encoding and the lower bound...”
Testo

Finite Pinwheel Scheduling: the k-Visits Problem di Kanellopoulos, Sotiris, Pergaminelis, Christos, Kokkou, Maria, Markou, Euripides, Pagourtzis, Aris

Sommario: “...-complete, it remains open whether Pinwheel Scheduling is NP-hard (unless a compact input encoding is used...”
Testo

R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies di Kimura, Kotaro, I, Tomohiro

Sommario: “... the run-length encoded BWT (RLBWT) of $T$, r-enum runs in $O(n \log \log_{w} (n/r))$ time in addition...”
Testo

Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations di Brown, Nathaniel K., Langmead, Ben

Sommario: “... balancing. An $O(r)$-time and $O(r)$-space construction lets us apply the method to run-length encoded BWT...”
Testo

Efficient Streaming Algorithms for Two-Dimensional Congruence Testing and Geometric Hashing di Chang, Yen-Cheng, Cheung, Tsun Ming, Tsai, Meng-Tsung, Wu, Ting-An

Sommario: “... of compactly encoding multiple point sets for efficient congruence queries. Despite its wide applications, both...”
Testo