Risultati della ricerca - (endedededededededededededededededededededededededecoding OR coding) (algorithmics OR algorithm)

Branch and Bound to Assess Stability of Regression Coefficients in Uncertain Models di Knaeble, Brian, Hughes, R. Mitchell, Rudolph, George, Abramson, Mark A., Razo, Daniel

Sommario: “... to efficiently search, with a branch and bound algorithm, for maximum and minimum values of that adjusted slope...”
Testo

Automatic Detection, Positioning and Counting of Grape Bunches Using Robots di Gao, Xumin

Sommario: “... designs a set of automatic detection, positioning and counting algorithms for grape bunches, and applies...”
Testo

Learning High-Quality Latent Representations for Anomaly Detection and Signal Integrity Enhancement in High-Speed Signals di Usama, Muhammad, Jang, Hee-Deok, Shanbhag, Soham, Sung, Yoo-Chang, Bae, Seung-Jun, Chang, Dong Eui

Sommario: “... on valid data features. Our approach is evaluated across three anomaly detection algorithms...”
Testo

Revisiting CHAMPAGNE: Sparse Bayesian Learning as Reweighted Sparse Coding di Sechet, Dylan, Kowalski, Matthieu, Mokhtari, Samy, Torrésani, Bruno

Sommario: “...This paper revisits the CHAMPAGNE algorithm within the Sparse Bayesian Learning (SBL) framework...”
Testo

Awesome-OL: An Extensible Toolkit for Online Learning di Liu, Zeyi, Hu, Songqiao, Han, Pengyu, Liu, Jiaming, He, Xiao

Sommario: “... to process streaming and non-stationary data. To facilitate algorithm development and practical deployment...”
Testo

Dual Orthogonal Projections for Multiuser Interference Cancellation in mmWave Beamforming With Uniform Planar Arrays di Li, Jiazhe, Dong, Heng, Decarli, Nicolò, Guidi, Francesco, Guerra, Anna, Bazzi, Alessandro, Li, Zhuoming

Sommario: “...) beamforming in communication systems. We propose a linear algorithm, termed iterative dual orthogonal...”
Testo

On the Complexity of Decoded Quantum Interferometry di Marwaha, Kunal, Fefferman, Bill, Gheorghiu, Alexandru, Havlicek, Vojtech

Sommario: “...We study the complexity of Decoded Quantum Interferometry (DQI), a quantum algorithm...”
Testo

Implementing FFTs in Practice di Johnson, Steven G., Frigo, Matteo

Sommario: “... "radix-2 Cooley-Tukey" FFT algorithms, in order to compensate for the memory hierarchy and exploit...”
Testo

High-Rate Fair-Density Parity-Check Codes di Mahdavifar, Hessam

Sommario: “... fresh investigation of new code constructions and decoding algorithms in high-rate regimes suitable...”
Testo

i-PI 2.0: A Universal Force Engine for Advanced Molecular Simulations di Kapil, Venkat, Rossi, Mariana, Marsalek, Ondrej, Petraglia, Riccardo, Litman, Yair, Spura, Thomas, Cheng, Bingqing, Cuzzocrea, Alice, Meißner, Robert H., Wilkins, David M., Juda, Przemyslaw, Bienvenue, Sébastien P., Fang, Wei, Kessler, Jan, Poltavsky, Igor, Vandenbrande, Steven, Wieme, Jelle, Corminboeuf, Clemence, Kühne, Thomas D., Manolopoulos, David E., Markland, Thomas E., Richardson, Jeremy O., Tkatchenko, Alexandre, Tribello, Gareth A., Van Speybroeck, Veronique, Ceriotti, Michele

Sommario: “... is slowed down by the bottleneck associated with implementing new optimization algorithms and/or sampling...”
Testo

A Low-Complexity Diversity-Preserving Universal Bit-Flipping Enhanced Hard Decision Decoder for Arbitrary Linear Codes di Bere, Praveen Sai, Khan, Mohammed Zafar Ali, Hanzo, Lajos

Sommario: “... results provided for various known codes and decoding algorithms validate the performance versus...”
Testo

Rapid Optimization of Superposition Codes for Multi-Hop NOMA MANETs via Deep Unfolding di Alter, Tomer, Shlezinger, Nir

Sommario: “... an algorithm for rapidly optimizing superposition codes in multi-hop NOMA MANETs. To achieve reliable tunning...”
Testo

AlgoTune: Can Language Models Speed Up General-Purpose Numerical Programs? di Press, Ori, Amos, Brandon, Zhao, Haoyu, Wu, Yikai, Ainsworth, Samuel K., Krupke, Dominik, Kidger, Patrick, Sajed, Touqir, Stellato, Bartolomeo, Park, Jisun, Bosch, Nathanael, Meril, Eli, Steppi, Albert, Zharmagambetov, Arman, Zhang, Fangzhao, Perez-Pineiro, David, Mercurio, Alberto, Zhan, Ni, Abramovich, Talor, Lieret, Kilian, Zhang, Hanlin, Huang, Shirley, Bethge, Matthias, Press, Ofir

Sommario: “... algorithms in an open-ended benchmark: We task LMs with writing code that efficiently solves computationally...”
Testo

CrossTrace: Efficient Cross-Thread and Cross-Service Span Correlation in Distributed Tracing for Microservices di Phan, Linh-An, Wang, MingXue, Wu, Guangyu, Dawei, Wang, Liqun, Chen, Jin, Li

Sommario: “...-code instrumentation solutions, such as those based on eBPF, have emerged, allowing span data...”
Testo

Brace for impact: ECDLP challenges for quantum cryptanalysis di Dallaire-Demers, Pierre-Luc, Doyle, William, Foo, Timothy

Sommario: “... applications of Shor's algorithm. We introduce a difficulty-graded suite of elliptic curve discrete logarithm...”
Testo

DaCe AD: Unifying High-Performance Automatic Differentiation for Machine Learning and Scientific Computing di Boudaoud, Afif, Calotoiu, Alexandru, Copik, Marcin, Hoefler, Torsten

Sommario: “... engine that requires no code modifications. DaCe AD uses a novel ILP-based algorithm to optimize...”
Testo

High Rate Efficient Local List Decoding from HDX di Dikstein, Yotam, Hopkins, Max, Impagliazzo, Russell, Pitassi, Toniann

Sommario: “...We construct the first (locally computable, approximately) locally list decodable codes with rate...”
Testo

From Paper to Program: Accelerating Quantum Many-Body Algorithm Development via a Multi-Stage LLM-Assisted Workflow di Zhou, Yi

Sommario: “...Large language models (LLMs) can generate code rapidly but remain unreliable for scientific...”
Testo

Learning from Acceptance: Cumulative Regret in the Game of Coding di Nodehi, Hanzaleh Akbari, Moradi, Parsa, Maddah-Ali, Mohammad Ali

Sommario: “...Classical coding-theoretic guarantees often rely on trust assumptions, such as requiring...”
Testo

Automatizing Software Cognitive Complexity Reduction through Integer Linear Programming di Saborido, Rubén, Ferrer, Javier, Chicano, Francisco

Sommario: “... threshold. However, exhaustive enumeration algorithms fail to scale with the code size. The number...”
Testo