Risultati della ricerca - coding (algorithmsssicics OR (algorithm OR Algorithms))

ResidualSketch: Enhancing Layer Efficiency and Error Reduction in Hierarchical Heavy Hitter Detection with ResNet Innovations di Liu, Xilai, Tian, Yuxuan, Wang, Xiangyuan, Wu, Yuhan, Wu, Wenhao, Yang, Tong, Xie, Gaogang

Sommario: “... algorithm for HHH detection in hierarchical traffic analysis. ResidualSketch distinguishes itself...”
Testo

Median and Small Parsimony Problems on RNA trees di Marchand, Bertrand, Anselmetti, Yoann, Lafond, Manuel, Ouangraoua, Aïda

Sommario: “...Motivation: Non-coding RNAs (ncRNAs) express their functions by adopting molecular structures...”
Testo

LimTDD: A Compact Decision Diagram Integrating Tensor and Local Invertible Map Representations di Hong, Xin, Dai, Aochu, Gao, Dingchao, Li, Sanjiang, Ji, Zhengfeng, Ying, Mingsheng

Sommario: “... tasks. We present efficient algorithms for normalization, slicing, addition, and contraction, critical...”
Testo

Probabilistic RNA Designability via Interpretable Ensemble Approximation and Dynamic Decomposition di Zhou, Tianshuo, Mathews, David H., Huang, Liang

Sommario: “... programming algorithm that efficiently searches over exponentially many decompositions and identifies...”
Testo

Parameterized Complexity of Efficient Sortation di Ganian, Robert, Hoang, Hung P., Wietheger, Simon

Sommario: “... utilize Ramsey-type arguments and color-coding techniques to obtain parameterized algorithms for both...”
Testo

HART: A Hybrid Addressing Scheme for Self-Balancing Binary Search Trees in Phase Change Memory (PCM) di Desai, Mahek, Rumale, Apoorva, Asadinia, Marjan

Sommario: “... access times, and zero leakage power. However, current memory-intensive algorithms, especially those used...”
Testo

MagnifierSketch: Quantile Estimation Centered at One Point di Guo, Jiarui, Lyu, Qiushi, Wu, Yuhan, Li, Haoyu, Yao, Zhaoqian, Dong, Yuqi, Wang, Xiaolin, Cui, Bin, Yang, Tong

Sommario: “... arbitrary quantile estimation. However, existing algorithms are not specially designed for per-key...”
Testo

Interactive Coding with Unbounded Noise di Fargion, Eden, Gelles, Ran, Gupta, Meghal

Sommario: “...Interactive coding allows two parties to conduct a distributed computation despite noise corrupting...”
Testo

Upper Bounds for Linear Graph Codes di Leo Versteegen

Sommario: “...Upper Bounds for Linear Graph Codes Leo Versteegen Random Structures & Algorithms ABSTRACTA linear...”
Testo

Optimal Testing of Reed-Muller Codes with an Online Adversary di Kelman, Esty, Meir, Uri, Zheng, Kai Zhe

Sommario: “...} for Reed-Muller codes. The task in Reed-Muller testing is to determine whether an input function $f: \F^n...”
Testo

Ultra-Resilient Superimposed Codes: Near-Optimal Construction and Applications di De Marco, Gianluca, Kowalski, Dariusz R.

Sommario: “...A superimposed code is a collection of binary vectors (codewords) with the property that no vector...”
Testo

Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies di Long, Yaowei, Pettie, Seth, Saranurak, Thatchaphol

Sommario: “... uses an improved edge-expander hierarchy and a distributed coding technique based on Reed-Solomon codes...”
Testo

Numerical treatment of cosserat based rate independent strain gradient plasticity theories di Juan David Gómez C.

Sommario: “... David Gómez C. Ingeniería Non couple stress theory constitutive modeling integration algorithms finite...”
Testo

The Probability That a Random Graph is Even‐Decomposable di Oliver Janzer, Fredy Yip

Sommario: “... & Algorithms ABSTRACT A graph with an even number of edges is called even‐decomposable if there is a sequence...”
Testo

Beyond a Single Queue: Multi-Level-Multi-Queue as an Effective Design for SSSP problems on GPUs di Hu, Zhengding, Sun, Jingwen, Jiang, Le, Wang, Yuhao, Lin, Junqing, Zong, Yi, Sun, Guangzhong

Sommario: “...-of-the-art implementations. Our code is open-sourced at https://github.com/Leo9660/MLMQ.git. ...”
Testo

On the rank, Kernel, and core of sparse random graphs di Patrick DeMichele, Margalit Glasgow, Alexander Moreira

Sommario: “... Moreira Random Structures & Algorithms AbstractWe study the rank of the adjacency matrix of a random Erdős...”
Testo

A survey of BWT variants for string collections di Cenzato, Davide, Lipták, Zsuzsanna

Sommario: “... multiplicative factor of up to $4.2$. Source code and scripts to replicate the results and download the data used...”
Testo

Simpler and Improved Replacement Path Coverings di Bilò, Davide, Chechik, Shiri, Choudhary, Keerti, Cohen, Sarel, Schirneck, Martin

Sommario: “...-correcting codes and an increased covering value of $O((cfL \log n)^{f+1})$ for some constant $c > 1$. We...”
Testo

Width Parameters for Minimum Flow Decomposition di Grigorjew, Andreas, Jiamjitrak, Wanchote, Mumey, Brendan, Tomescu, Alexandru I.

Sommario: “... general statement that MFD with unary coded input can be solved in quasi-polynomial time on DAGs...”
Testo

Subset-lex: did we miss an order? di Arndt, Jörg

Sommario: “...We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic...”
Testo