Risultati della ricerca - coding (algorithmssicssics OR (algorithm OR (algorithm OR algorithm)))

Sparse Regression LDPC Codes di Ebert, Jamison R., Chamberland, Jean-Francois, Narayanan, Krishna R.

Sommario: “...This article introduces a novel concatenated coding scheme called sparse regression LDPC (SR-LDPC...”
Testo

A Block-Based Heuristic Algorithm for the Three-Dimensional Nuclear Waste Packing Problem di Wen, Yajie, Zhang, Defu

Sommario: “...In this study, we present a block-based heuristic search algorithm to address the nuclear waste...”
Testo

Hardware.jl - An MLIR-based Julia HLS Flow (Work in Progress) di Short, Benedict, McInerney, Ian, Wickerson, John

Sommario: “...Co-developing scientific algorithms and hardware accelerators requires domain-specific knowledge...”
Testo

An Error Correctable Implication Algebra for a System of Qubits di Turnansky, Morrison

Sommario: “... of an arbitrary quantum error correcting stabilizer code. We then fully characterize the non trivial errors...”
Testo

MOSAIC: Multi-agent Orchestration for Task-Intelligent Scientific Coding di Raghavan, Siddeshwar, Mallick, Tanwi

Sommario: “... scientific coding tasks. Unlike general-purpose coding, scientific workflows require algorithms...”
Testo

Incentive-Aware Recommender Systems in Two-Sided Markets di Dai, Xiaowu, Xu, Wenlu, Qi, Yuan, Jordan, Michael I.

Sommario: “... algorithms satisfy an ex-post fairness criterion, which protects agents from over-exploitation. All code...”
Testo

FRENETIX: A High-Performance and Modular Motion Planning Framework for Autonomous Driving di Trauth, Rainer, Moller, Korbinian, Wuersching, Gerald, Betz, Johannes

Sommario: “... sampling-based trajectory planning algorithm. This approach effectively tackles the challenges of solution...”
Testo

KetGPT - Dataset Augmentation of Quantum Circuits using Transformers di Apak, Boran, Bandic, Medina, Sarkar, Aritra, Feld, Sebastian

Sommario: “...-written algorithm-based code (e.g., order of gates and qubits). Our three-fold verification process...”
Testo

DTR-Bench: An in silico Environment and Benchmark Platform for Reinforcement Learning Based Dynamic Treatment Regime di Luo, Zhiyao, Zhu, Mingcheng, Liu, Fenglin, Li, Jiali, Pan, Yangchen, Zhou, Jiandong, Zhu, Tingting

Sommario: “... algorithms within these contexts. To address this gap, we introduce \textit{DTR-Bench}, a benchmarking...”
Testo

TSI-Bench: Benchmarking Time Series Imputation di Du, Wenjie, Wang, Jun, Qian, Linglong, Yang, Yiyuan, Ibrahim, Zina, Liu, Fanxing, Wang, Zepu, Liu, Haoxin, Zhao, Zhiyuan, Zhou, Yingjie, Wang, Wenjia, Ding, Kaize, Liang, Yuxuan, Prakash, B. Aditya, Wen, Qingsong

Sommario: “... the development of numerous deep learning algorithms for time series imputation, the community lacks standardized...”
Testo

A faster multipole Legendre-Chebyshev transform di Mortensen, Mikael

Sommario: “...This paper describes a fast algorithm for transforming Legendre coefficients into Chebyshev...”
Testo

Parallel Contraction Hierarchies Can Be Efficient and Scalable di Wan, Zijin, Dong, Xiaojun, Wang, Letong, Zhu, Enzuo, Gu, Yan, Sun, Yihan

Sommario: “...Contraction Hierarchies (CH) (Geisberger et al., 2008) is one of the most widely used algorithms...”
Testo

Fast and Near-Optimal Collision-Free Robot Scheduling On Paths di Adamson, Duncan, Flaherty, Nathan, Potapov, Igor, Spirakis, Paul G., Zamaraeva, Elena

Sommario: “... algorithm (PA) introduced in arXiv:2402.12019 and present three baselines for comparison: an integer...”
Testo

Accelerating Machine Learning Systems via Category Theory: Applications to Spherical Attention for Gene Regulatory Networks di Abbott, Vincent, Kamiya, Kotaro, Glowacki, Gerard, Atsumi, Yu, Zardini, Gioele, Maruyama, Yoshihiro

Sommario: “... automated compilation methods are poor, and efficient algorithms require years of human development...”
Testo

The Right to be Forgotten in Pruning: Unveil Machine Unlearning on Sparse Models di Xiao, Yang, Li, Gen, Ji, Jie, Ye, Ruimeng, Ma, Xiaolong, Hui, Bo

Sommario: “... and unlearning algorithms. Our code is released at https://github.com/NKUShaw/SparseModels . ...”
Testo

Prompting Lipschitz-constrained network for multiple-in-one sparse-view CT reconstruction di Shi, Baoshun, Jiang, Ke, Lian, Qiusheng, Yu, Xinran, Fu, Huazhu

Sommario: “... analyzing the convergence of the proposed iterative algorithms. The data and code are publicly available...”
Testo

Square-root Time Atom Reconfiguration Plan for Lattice-shaped Mobile Tweezers di Aoyama, Koki, Tomita, Takafumi, Ino, Fumihiko

Sommario: “...This paper proposes a scalable planning algorithm for creating defect-free atom arrays in neutral...”
Testo

Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors di Kao, Ming-Yang, Wang, Jie

Sommario: “... approximation algorithm that has a provably small error for arbitrary $X$. Our algorithm incurs a worst-case...”
Testo

MementoHash: A Stateful, Minimal Memory, Best Performing Consistent Hash Algorithm di Coluzzi, Massimo, Brocco, Amos, Antonucci, Alessandro, Leidi, Tiziano

Sommario: “... and minimal memory usage. We describe the algorithm in detail, provide a pseudo-code implementation...”
Testo

Benchmarking End-To-End Performance of AI-Based Chip Placement Algorithms di Wang, Zhihai, Geng, Zijie, Tu, Zhaojie, Wang, Jie, Qian, Yuxi, Xu, Zhexuan, Liu, Ziyan, Xu, Siyuan, Tang, Zhentao, Kai, Shixiong, Yuan, Mingxuan, Hao, Jianye, Li, Bin, Zhang, Yongdong, Wu, Feng

Sommario: “...-based algorithms in enhancing chip placement. However, due to the lengthy workflow of chip design...”
Testo