Risultati della ricerca - (decoding OR coding) (algorithm OR algorithmssics)

Fast Tracking of 6D Particle Phase Space Using the FC2CT Algorithm for rf Cavities di Southerby, Matthew, Apsimon, Robert

Sommario: “...In this paper, a fast cell to cell tracking algorithm (FC2CT) is developed, that determines...”
Testo

Utility of virtual qubits in trapped-ion quantum computers di Shivam, Saumya, Pokorny, Fabian, Vazquez-Brennan, Andres, Sotirova, Ana S., Leppard, Jamie D., Decoppet, Sophie M., Ballance, C. J., Sondhi, S. L.

Sommario: “... more qubits and to simplify circuits implementing standard algorithms. By using such `virtual' qubits...”
Testo

Combining Neuroevolution with the Search for Novelty to Improve the Generation of Test Inputs for Games di Feldmeier, Patric, Fraser, Gordon

Sommario: “... test suites consisting of neural networks that exercise the source code by playing the games. Neatest...”
Testo

Compositional Distributed Learning for Multi-View Perception: A Maximal Coding Rate Reduction Perspective di Tian, Zhuojun, Bennis, Mehdi

Sommario: “... perception by leveraging the maximal coding rate reduction principle combined with subspace basis fusion...”
Testo

Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes di Peham, Tom, Schmid, Ludwig, Berent, Lucas, Müller, Markus, Wille, Robert

Sommario: “...A central ingredient in fault-tolerant quantum algorithms is the initialization of a logical state...”
Testo

The Definitive Guide to Policy Gradients in Deep Reinforcement Learning: Theory, Algorithms and Implementations di Lehmann, Matthias

Sommario: “...In recent years, various powerful policy gradient algorithms have been proposed in deep...”
Testo

A Beam Search Based Parallel Algorithm for the Two-Dimensional Strip Packing Problem di Wen, Yajie, Zhang, Defu

Sommario: “...This paper introduces BSPA, a parallel algorithm that leverages beam search to address the two...”
Testo

Large Language Model Partitioning for Low-Latency Inference at the Edge di Kafetzis, Dimitrios, Khalili, Ramin, Koutsopoulos, Iordanis

Sommario: “...Large Language Models (LLMs) based on autoregressive, decoder-only Transformers generate text one...”
Testo

MiniCPM4: Ultra-Efficient LLMs on End Devices di MiniCPM Team, Xiao, Chaojun, Li, Yuxuan, Han, Xu, Bai, Yuzhuo, Cai, Jie, Chen, Haotian, Chen, Wentong, Cong, Xin, Cui, Ganqu, Ding, Ning, Fan, Shengda, Fang, Yewei, Fu, Zixuan, Guan, Wenyu, Guan, Yitong, Guo, Junshao, Han, Yufeng, He, Bingxiang, Huang, Yuxiang, Ji, Baoxi, Kong, Cunliang, Li, Qiuzuo, Li, Siyuan, Li, Wenhao, Li, Xin, Li, Yanghao, Li, Yishan, Li, Zhen, Liu, Dan, Lin, Biyuan, Lin, Yankai, Long, Xiang, Lu, Quanyu, Lu, Yaxi, Luo, Peiyan, Lyu, Hongya, Ou, Litu, Pan, Yinxu, Pu, Lushi, Qu, Zekai, Shi, Qundong, Song, Zijun, Su, Jiayuan, Su, Zhou, Sun, Ao, Sun, Xianghui, Tang, Peijun, Wang, Fangzheng, Wang, Feng, Wang, Shuo, Wang, Yudong, Wang, Zheng, Wu, Yesai, Xiao, Zhenyu, Xie, Jie, Xie, Zihao, Xu, Xiaoyue, Yan, Yukun, Yuan, Jiarui, Zhang, Jinqian, Zhang, Kaihuo, Zhang, Lei, Zhang, Linyue, Zhang, Xueren, Zhang, Yudi, Zhao, Hengyu, Zhao, Weilin, Zhao, Weilun, Zhao, Yuanqian, Zheng, Zhi, Zhou, Chuyue, Zhou, Ge, Zhou, Jie, Zhou, Wei, Zhou, Yanghao, Zhou, Zihan, Zhou, Zixuan, Liu, Zhiyuan, Zeng, Guoyang, Jia, Chao, Li, Dahai, Sun, Maosong

Sommario: “...: model architecture, training data, training algorithms, and inference systems. Specifically, in terms...”
Testo

Parallel Sampling via Autospeculation di Anari, Nima, Baronio, Carlo, Chen, CJ, Haqi, Alireza, Koehler, Frederic, Li, Anqi, Vuong, Thuy-Duong

Sommario: “...We present parallel algorithms to accelerate sampling via counting in two settings: any-order...”
Testo

Robust Indexing for Challenging Serial X-ray Diffraction Patterns di Nasser, Marc M, Poitevin, Frédéric, Dalton, Kevin M

Sommario: “... regime. We introduce a robust indexing algorithm tailored to this setting. We formulate indexing as a...”
Testo

Towards Autonomous Driving with Short-Packet Rate Splitting: Age of Information Analysis and Optimization di Zheng, Zirui, Chen, Yingyang, Pei, Xinyue, Wang, Xingwei, Liu, Zhiquan, Tsiftsis, Theodoros A., Wen, Miaowen, Fan, Pingzhi

Sommario: “... expressions for the average AoI (AAoI) of the common stream under partial decoding and the overall AAoI under...”
Testo

Highway to Hull: An Algorithm for Solving the General Matrix Code Equivalence Problem di Couvreur, Alain, Levrat, Christophe

Sommario: “...The matrix code equivalence problem consists, given two matrix spaces $\mathcal{C},\mathcal{D...”
Testo

Evaluating Line-level Localization Ability of Learning-based Code Vulnerability Detection Models di Pintore, Marco, Piras, Giorgio, Sotgiu, Angelo, Pintor, Maura, Biggio, Battista

Sommario: “... entrusted to Machine Learning (ML) algorithms. Despite their now established detection capabilities...”
Testo

Coexisting Passive RIS and Active Relay Assisted NOMA Systems di Huang, Ao, Guo, Li, Mu, Xidong, Dong, Chao, Liu, Yuanwei

Sommario: “...A novel coexisting passive reconfigurable intelligent surface (RIS) and active decode-and-forward...”
Testo

Optimizing Attention with Mirror Descent: Generalized Max-Margin Token Selection di Julistiono, Addison Kristanto, Tarzanagh, Davoud Ataee, Azizan, Navid

Sommario: “... general optimization algorithms such as mirror descent (MD). In this paper, we investigate the convergence...”
Testo

Power Allocation for Compute-and-Forward over Fading Channels di Zhang, Lanwei, Evans, Jamie, Zhu, Jingge

Sommario: “...Compute-and-forward (CF) is a relaying strategy which allows the relay to decode a linear...”
Testo

Sensing-Assisted Channel Estimation for Bistatic OFDM ISAC Systems: Framework, Algorithm, and Analysis di Wang, Shuhan, Tang, Aimin, Wang, Xudong, Qu, Wenze

Sommario: “... estimation and decoding. To address the potential sensing errors caused by low-complexity sensing algorithms...”
Testo

An Algorithm for Fast Assembling Large-Scale Defect-Free Atom Arrays di Zhang, Tao, Li, Xiaodi, Zhai, Hui, Chen, Linghui

Sommario: “... defect-free atom array with ~ 10^4 qubits remains algorithmically challenging, alongside other hardware...”
Testo

Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized Construction di Tsunoda, Yu, Fujiwara, Yuichiro

Sommario: “... algorithm for codes that asymptotically attain our improved bound with high probability. Our probabilistic...”
Testo