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

Evolving Algebraic Multigrid Methods Using Grammar-Guided Genetic Programming par Parthasarathy, Dinesh, Mitchell, Wayne Bradford, Köstler, Harald

Table des matières: “…Multigrid methods despite being known to be asymptotically optimal algorithms, depend…”
Accéder au texte intégral

CONCLAD: COntinuous Novel CLAss Detector par Rios, Amanda, Ndiour, Ibrahima, Datta, Parual, Tickoo, Omesh, Ahuja, Nilesh

Table des matières: “…. At each new task, our approach employs an iterative uncertainty estimation algorithm to differentiate…”
Accéder au texte intégral

Evidence of Non-Equilibrium Critical Phenomena in a Simple Model of Traffic par Jha, Aryaman, Wiesenfeld, Kurt, Lee, Garyoung, Laval, Jorge

Table des matières: “… continuous phase transition. We exploit specific properties of ECA 184 to develop an efficient algorithm…”
Accéder au texte intégral

A validated fluid-structure interaction simulation model for vortex-induced vibration of a flexible pipe in steady flow par Fu, Xuepeng, Fu, Shixiao, Niu, Zhibo, Zhao, Bing, Shen, Jiawei, Deng, Pengqian

Table des matières: “… beam theory, and fluid-structure coupling is implemented via a weak coupling algorithm developed…”
Accéder au texte intégral

Learning Selection Cuts With Gradients par Hance, Mike, Robles, Juan

Table des matières: “… of multivariate algorithms like BDTs or neural networks. We revisit this problem, and develop a cut optimization…”
Accéder au texte intégral

Hyperspherical Normalization for Scalable Deep Reinforcement Learning par Lee, Hojoon, Lee, Youngdo, Seno, Takuma, Kim, Donghu, Stone, Peter, Choo, Jaegul

Table des matières: “…. Using the soft actor-critic as a base algorithm, SimbaV2 scales up effectively with larger models…”
Accéder au texte intégral

Towards Understanding the Safety Boundaries of DeepSeek Models: Evaluation and Findings par Ying, Zonghao, Zheng, Guangyi, Huang, Yongxin, Zhang, Deyue, Zhang, Wenxin, Zou, Quanchen, Liu, Aishan, Liu, Xianglong, Tao, Dacheng

Table des matières: “… across multiple risk dimensions, including algorithmic discrimination and sexual content. These findings…”
Accéder au texte intégral

Rankformer: A Graph Transformer for Recommendation based on Ranking Objective par Chen, Sirui, Han, Shen, Chen, Jiawei, Hu, Binbin, Zhou, Sheng, Wang, Gang, Feng, Yan, Chen, Chun, Wang, Can

Table des matières: “… further develop an acceleration algorithm for Rankformer, reducing its complexity to a linear level…”
Accéder au texte intégral

EBS-EKF: Accurate and High Frequency Event-based Star Tracking par Reed, Albert W, Hashemi, Connor, Melamed, Dennis, Menon, Nitesh, Hirakawa, Keigo, McCloskey, Scott

Table des matières: “… signal models. We propose a novel algorithm for event-based star tracking, grounded in an analysis…”
Accéder au texte intégral

Anomaly Detection for Hybrid Butterfly Subspecies via Probability Filtering par Ruan, Bo-Kai, Fang, Yi-Zeng, Shuai, Hong-Han, Huang, Juinn-Dar

Table des matières: “… based on their taxonomy. Consequently, the algorithm designed for species A can be transferred to B…”
Accéder au texte intégral

Merging Embedded Topics with Optimal Transport for Online Topic Modeling on Data Streams par Granese, Federica, Navet, Benjamin, Villata, Serena, Bouveyron, Charles

Table des matières: “… detection algorithm is employed to identify shifts in topics over time, enabling the identification…”
Accéder au texte intégral

Denoising Application Performance Models with Noise-Resilient Priors par de Morais, Gustavo, Geiß, Alexander, Calotoiu, Alexandru, Corbin, Gregor, Tarraf, Ahmad, Hoefler, Torsten, Mohr, Bernd, Wolf, Felix

Table des matières: “…As parallel codes are scaled to larger computing systems, performance models play a crucial role…”
Accéder au texte intégral

Frequency-domain Learning with Kernel Prior for Blind Image Deblurring par Sun, Jixiang, Lei, Fei, Zhang, Jiawei, Sun, Wenxiu, Yang, Yujiu

Table des matières: “… method inspired by traditional deblurring algorithms that perform deconvolution in the frequency domain…”
Accéder au texte intégral

Explicit Lossless Vertex Expanders par Hsieh, Jun-Ting, Lubotzky, Alexander, Mohanty, Sidhanth, Reiner, Assaf, Zhang, Rachel Yun

Table des matières: “… codes of Lin and M. Hsieh with a linear time decoding algorithm. Our construction is based on taking…”
Accéder au texte intégral

An Algebraic Approach to Asymmetric Delegation and Polymorphic Label Inference (Technical Report) par Ren, Silei, Acay, Coşku, Myers, Andrew C.

Table des matières: “… and implement a novel algorithm that statically checks NMIF and a label inference procedure that efficiently…”
Accéder au texte intégral

Polarization Decomposition and Its Applications par Qi, Tianfu, Wang, Jun

Table des matières: “… as a function of the block length and subchannel index is derived. Furthermore, an efficient algorithm…”
Accéder au texte intégral

ResidualSketch: Enhancing Layer Efficiency and Error Reduction in Hierarchical Heavy Hitter Detection with ResNet Innovations par Liu, Xilai, Tian, Yuxuan, Wang, Xiangyuan, Wu, Yuhan, Wu, Wenhao, Yang, Tong, Xie, Gaogang

Table des matières: “… algorithm for HHH detection in hierarchical traffic analysis. ResidualSketch distinguishes itself…”
Accéder au texte intégral

GraSS: Scalable Data Attribution with Gradient Sparsification and Sparse Projection par Hu, Pingbang, Melkonian, Joseph, Tang, Weijing, Zhao, Han, Ma, Jiaqi W.

Table des matières: “… computation. In this work, we propose GraSS, a novel gradient compression algorithm and its variants FactGraSS…”
Accéder au texte intégral

Reward-Independent Messaging for Decentralized Multi-Agent Reinforcement Learning par Yoshida, Naoto, Taniguchi, Tadahiro

Table des matières: “… learning model based on collective predictive coding (CPC) from emergent communication research. Unlike…”
Accéder au texte intégral

BINGO! Simple Optimizers Win Big if Problems Collapse to a Few Buckets par Ganguly, Kishan Kumar, Menzies, Tim

Table des matières: “… faster than state-of-the-art methods, with comparable effectiveness. Our new algorithms (LITE and LINE…”
Accéder au texte intégral