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

LiFT: Lightweight, FPGA-tailored 3D object detection based on LiDAR data par Lis, Konrad, Kryjak, Tomasz, Gorgon, Marek

Table des matières: “…This paper presents LiFT, a lightweight, fully quantized 3D object detection algorithm for LiDAR…”
Accéder au texte intégral

Superimposed Pilot-Based OTFS: Will It Work? par Kanazawa, Yuta, Iimori, Hiroki, Pradhan, Chandan, Malomsoky, Szabolcs, Ishikawa, Naoki

Table des matières: “… on the SP-based OTFS system in channel coded scenarios, we propose a novel pilot assignment scheme…”
Accéder au texte intégral

Don't Get Lost in the Trees: Streamlining LLM Reasoning by Overcoming Tree Search Exploration Pitfalls par Wang, Ante, Song, Linfeng, Tian, Ye, Yu, Dian, Mi, Haitao, Duan, Xiangyu, Tu, Zhaopeng, Su, Jinsong, Yu, Dong

Table des matières: “…Recent advancements in tree search algorithms guided by verifiers have significantly enhanced…”
Accéder au texte intégral

Leveraging Qubit Loss Detection in Fault Tolerant Quantum Algorithms par Baranes, Gefen, Cain, Madelyn, Ataides, J. Pablo Bonilla, Bluvstein, Dolev, Sinclair, Josiah, Vuletic, Vladan, Zhou, Hengyun, Lukin, Mikhail D.

Table des matières: “… and correct loss errors in logical algorithms and leverage such loss information in decoding. Considering…”
Accéder au texte intégral

PDX: A Data Layout for Vector Similarity Search par Kuffo, Leonardo, Krippner, Elena, Boncz, Peter

Table des matières: “… distance kernels on standard horizontal vector storage (avg 40% faster), only relying on scalar code…”
Accéder au texte intégral

LLM-Guided Evolution: An Autonomous Model Optimization for Object Detection par Yu, YiMing, Zutty, Jason

Table des matières: “… modify model source code for image classification algorithms on CIFAR data and intelligently guide…”
Accéder au texte intégral

A Tale of Two Learning Algorithms: Multiple Stream Random Walk and Asynchronous Gossip par Gholami, Peyman, Seferoglu, Hulya

Table des matières: “…Although gossip and random walk-based learning algorithms are widely known for decentralized…”
Accéder au texte intégral

Auto-Test: Learning Semantic-Domain Constraints for Unsupervised Error Detection in Tables par Chen, Qixu, He, Yeye, Wong, Raymond Chi-Wing, Cui, Weiwei, Ge, Song, Zhang, Haidong, Zhang, Dongmei, Chaudhuri, Surajit

Table des matières: “… algorithms have been developed to detect and repair data errors in tables, existing algorithms predominantly…”
Accéder au texte intégral

Multi-goal Rapidly Exploring Random Tree with Safety and Dynamic Constraints for UAV Cooperative Path Planning par Khuat, Thu Hang, Bui, Duy-Nam, Nguyen, Hoa TT., Trinh, Mien L., Nguyen, Minh T., Phung, Manh Duong

Table des matières: “… for cooperative tasks. The source code of the algorithm is available at https://github.com/duynamrcv/multi…”
Accéder au texte intégral

Exposing the Copycat Problem of Imitation-based Planner: A Novel Closed-Loop Simulator, Causal Benchmark and Joint IL-RL Baseline par Zhou, Hui, Shi, Shaoshuai, Li, Hongsheng

Table des matières: “… advantages over traditional optimization-based planning algorithms. These advantages include fewer manually…”
Accéder au texte intégral

LiveCodeBench Pro: How Do Olympiad Medalists Judge LLMs in Competitive Programming? par Zheng, Zihan, Cheng, Zerui, Shen, Zeyu, Zhou, Shang, Liu, Kaiyuan, He, Hansen, Li, Dongruixuan, Wei, Stanley, Hao, Hangyi, Yao, Jianzhu, Sheng, Peiyao, Wang, Zixuan, Chai, Wenhao, Korolova, Aleksandra, Henderson, Peter, Arora, Sanjeev, Viswanath, Pramod, Shang, Jingbo, Xie, Saining

Table des matières: “… programming. Drawing on knowledge from a group of medalists in international algorithmic contests, we revisit…”
Accéder au texte intégral

Zero-Shot Neural Architecture Search with Weighted Response Correlation par Jing, Kun, Chen, Luoyu, Xu, Jungang, Tai, Jianwei, Wang, Yiyu, Li, Shuaimin

Table des matières: “… in architecture search. Experimental results on architecture search show that our zero-shot NAS algorithm…”
Accéder au texte intégral

Achievable Rates of Nanopore-based DNA Storage par McBain, Brendon, Viterbo, Emanuele

Table des matières: “… using a tractable channel model that does not rely on a basecalling algorithm. Specifically, the noisy…”
Accéder au texte intégral

Distributional Sensitivity Analysis: Enabling Differentiability in Sample-Based Inference par Chuang, Pi-Yueh, Attia, Ahmed, Constantinescu, Emil

Table des matières: “… computational cost at the cost of some accuracy. We additionally provide four second-order numerical algorithms…”
Accéder au texte intégral

Auditing Approximate Machine Unlearning for Differentially Private Models par Gu, Yuechun, He, Jiajie, Chen, Keke

Table des matières: “… applying approximate unlearning algorithms. We propose the privacy criteria for unlearned and retained…”
Accéder au texte intégral

GPU-Accelerated Loopy Belief Propagation for Program Analysis par Feng, Haoyu, Zhang, Xin

Table des matières: “…Loopy Belief Propagation (LBP) is a widely used approximate inference algorithm in probabilistic…”
Accéder au texte intégral

XQC: Well-conditioned Optimization Accelerates Deep Reinforcement Learning par Palenicek, Daniel, Vogt, Florian, Watson, Joe, Posner, Ingmar, Peters, Jan

Table des matières: “…Sample efficiency is a central property of effective deep reinforcement learning algorithms. Recent…”
Accéder au texte intégral

On the Capacity of Pixel Antenna based MIMO Communication par Lin, Shenrui, Zhang, Shuowen

Table des matières: “… by adaptively reconfiguring each antenna's radiation pattern via a so-called antenna coding technique which…”
Accéder au texte intégral

Exploring the Model Dependence of MCMC-Based 21 cm Power Spectrum Parameter Constraints par Berklas, August, Pober, Jonathan

Table des matières: “… Monte Carlo sampler of the semi-numerical simulation code 21cmFAST, has already been used in conjunction…”
Accéder au texte intégral

StarDist: A Code Generator for Distributed Graph Algorithms par Nandy, Barenya Kumar, Nasre, Rupesh

Table des matières: “… algorithms in the message passing model. Our analysis-transformation framework optimizes graph traversal…”
Accéder au texte intégral