Résultats de la recherche - coding ((Algorithmssssics OR (algorithm OR algorithm)) OR (algorithm OR Algorithmssssics))

Restart Belief: A General Quantum LDPC Decoder par Valentini, Lorenzo, Forlivesi, Diego, Talarico, Andrea, Chiani, Marco

Table des matières: “… decoder represents both the fastest and most accurate decoding algorithm applicable to QLDPC codes to date…”
Accéder au texte intégral

Partitioned Successive-Cancellation List Flip Decoding of Polar Codes par Pillet, Charles, Sagitov, Ilshat, Domer, Grégoire, Giard, Pascal

Table des matières: “…The recently proposed Successive-Cancellation List Flip (SCLF) decoding algorithm for polar codes…”
Accéder au texte intégral

Classical simulation of circuits with realistic odd-dimensional Gottesman-Kitaev-Preskill states par Calcluth, Cameron, Hahn, Oliver, Bermejo-Vega, Juani, Ferraro, Alessandro, Ferrini, Giulia

Table des matières: “…Classically simulating circuits with bosonic codes is challenging due to the prohibitive cost…”
Accéder au texte intégral

A Link between Coding Theory and Cross-Validation with Applications par Pahikkala, Tapio, Movahedi, Parisa, Montoya, Ileana, Miikonen, Havu, Foldes, Stephan, Airola, Antti, Major, Laszlo

Table des matières: “…, for which a learning algorithm can achieve zero LPOCV error, equals the maximal number of code words in a…”
Accéder au texte intégral

Reinforcement Learning for Near-Optimal Design of Zero-Delay Codes for Markov Sources par Cregg, Liam, Linder, Tamas, Yuksel, Serdar

Table des matières: “… in computationally prohibitive algorithmic implementations for code design. To address this problem, we present a…”
Accéder au texte intégral

Do AI Models Dream of Faster Code? An Empirical Study on LLM-Proposed Performance Improvements in Real-World Software par Yi, Lirong, Gay, Gregory, Leitner, Philipp

Table des matières: “…Large Language Models (LLMs) can generate code, but can they generate fast code for complex, real…”
Accéder au texte intégral

Can LLMs Compress (and Decompress)? Evaluating Code Understanding and Execution via Invertibility par Maveli, Nickil, Vergari, Antonio, Cohen, Shay B.

Table des matières: “…LLMs demonstrate strong performance on code benchmarks, yet consistent reasoning across forward…”
Accéder au texte intégral

Polyglot Jet Finding par Stewart, Graeme Andrew, Gras, Philippe, Hegner, Benedikt, Krasnopolski, Atell

Table des matières: “…. In this paper we compare a number of languages using a common, yet non-trivial, HEP algorithm: the \akt…”
Accéder au texte intégral

Solving nonograms using Neural Networks par Rubio, José María Buades, Jaume-i-Capó, Antoni, González, David López, Alcover, Gabriel Moyà

Table des matières: “… and the code of the algorithms. Combination of the heuristic algorithm with a neural network obtained the best…”
Accéder au texte intégral

IM-IAD: Industrial Image Anomaly Detection Benchmark in Manufacturing par Xie, Guoyang, Wang, Jinbao, Liu, Jiaqi, Lyu, Jiayi, Liu, Yong, Wang, Chengjie, Zheng, Feng, Jin, Yaochu

Table des matières: “… manufacturing (IM). Recently, many advanced algorithms have been reported, but their performance deviates…”
Accéder au texte intégral

Are Language Models Puzzle Prodigies? Algorithmic Puzzles Unveil Serious Challenges in Multimodal Reasoning par Ghosal, Deepanway, Han, Vernon Toh Yan, Ken, Chia Yew, Poria, Soujanya

Table des matières: “… the capabilities of multimodal language models in solving algorithmic puzzles that necessitate both visual…”
Accéder au texte intégral

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs par Hsieh, Chou-Ying, Lin, Po-Chieh, Kuo, Sy-Yen

Table des matières: “…The push-relabel algorithm is an efficient algorithm that solves the maximum flow/ minimum cut…”
Accéder au texte intégral

Can Large Language Models Invent Algorithms to Improve Themselves?: Algorithm Discovery for Recursive Self-Improvement through Reinforcement Learning par Ishibashi, Yoichi, Yano, Taro, Oyamada, Masafumi

Table des matières: “… employs an iterative cycle where a seed model generates algorithmic candidates as executable code…”
Accéder au texte intégral

Chebotarov continua, Jenkins-Strebel differentials and related problems: a numerical approach par Bertola, Marco

Table des matières: “…We detail a numerical algorithm and related code to construct rational quadratic differentials…”
Accéder au texte intégral

Towards High-Performance Network Coding: FPGA Acceleration With Bounded-value Generators par Qing, Jiaxin, Leong, Philip H. W., Lee, Kin Hong, Yeung, Raymond W.

Table des matières: “… techniques to improve coding efficiency. Optimization with an algorithm/hardware co-designing approach has…”
Accéder au texte intégral

A Parity-Consistent Decomposition Method for the Weight Distribution of Pre-Transformed Polar Codes par Liu, Yang, Wu, Bolin, Han, Yuxin, Niu, Kai

Table des matières: “…This paper introduces an efficient algorithm based on the Parity-Consistent Decomposition (PCD…”
Accéder au texte intégral

Quantum Algorithms for State Preparation and Data Classification based on Stabilizer Codes par Jouzdani, Pejman, Hashim, H. Arslan, Mucciolo, Eduardo R.

Table des matières: “… of encoding input information into entangled quantum states known as the code space. Furthermore, to classify…”
Accéder au texte intégral

A Random Coding Approach to Performance Analysis of the Ordered Statistic Decoding with Local Constraints par Liang, Jifan, Ma, Xiao

Table des matières: “…) of binary linear block codes, which is a near maximum-likelihood decoding algorithm. Compared…”
Accéder au texte intégral

Post-Quantum Cryptography: Securing Digital Communication in the Quantum Era par Mamatha, G S, Dimri, Namya, Sinha, Rasha

Table des matières: “… computing, and introduces various PQC algorithms such as lattice-based cryptography, code-based cryptography…”
Accéder au texte intégral

MFP: Making Full Use of Probability Maps for Interactive Image Segmentation par Lee, Chaewon, Lee, Seon-Ho, Kim, Chang-Su

Table des matières: “…In recent interactive segmentation algorithms, previous probability maps are used as network input…”
Accéder au texte intégral