ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Connectivity Augmentation Problem”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DSTheoreticalRecentJun 16, 2026

Online Connectivity Augmentation

Mohit Garg, Aditya Subramanian

The paper improves the competitive ratio for the online Connectivity Augmentation Problem.

View →
cs.CVcs.AIcs.LGEmpiricalRecentJun 30, 2026

Preserve the Hard, Regenerate the Rest: Uncertainty-Guided Synthetic Training Data Augmentation with Diffusion Models

Nikolai Röhrich, Julian Gleißner, Ahmed H. A. Ibrahim, Silvan Mertes +1 more

This paper proposes an uncertainty-guided synthetic context augmentation strategy for semantic segmentation models to improve performance on complex datasets with data sparsity and rare or visually di…

View →
cs.CVcs.AIRecentMay 30, 2026

Pre-Deployment Robustness Stress Testing for CT Segmentation Systems Using Clinically Motivated Multi-Corruption Augmentation

CholMin Kang, Jonghyun Chung, Amanpreet Kaurb, Nagesh Gulkotwarb +1 more

The paper proposes RAMP, a multi-corruption augmentation framework, which significantly improves the robustness and reliability of CT segmentation deep learning models when deployed in real-world, deg…

View →
cs.NEEmpiricalRecentOct 24, 2026

Optimal Connectivity of Random Boolean Networks for Reservoir Computing

Christopher Michael Skeide Vibe, Aliaksandr Hubin, Stefano Nichele

This paper studies the properties of random Boolean networks as reservoirs for reservoir computing and explores how design factors affect their computational capabilities.

View →
cs.LGcs.AIRecentMay 27, 2026

Evolutionary Refinement of Generative Graph Topologies: A Hybrid WGAN-GA Approach

James Sargant, Seyedeh Ava Razi Razavi, Renata Dividino, Sheridan Houghten

The paper introduces a hybrid WGAN-GA framework that uses a Genetic Algorithm (GA) to refine graphs generated by a GAN, significantly reducing structural deviations and improving realism.

View →
cs.DSEmpiricalRecentJun 12, 2026

On a Conjecture for Parameterized st-Orientations

Charalampos Papamanthou

This paper disproves a conjecture about the longest-path lengths of MaxSTN and MinSTN algorithms for producing $st$-orientations of biconnected graphs.

View →
cs.CRcs.CVRecentMay 28, 2026

AdvScene: Rethinking Adversarial Patch Evaluation Through Scene Robustness

Xiaoyong, Yuan, Lan, Zhang

The paper introduces AdvScene, a novel scene-grounded framework that measures the real-world 'scene robustness' of adversarial patches by characterizing their operational envelope across varying viewp…

View →
cs.LGcs.AIRecentMay 29, 2026

Beyond Augmentation: Score-Guided Pathological Prior for EEG-based Depression Detection

Xiaojing Chen, Jingqi Cheng, Xu Zhao, Wan Jiang +1 more

The paper introduces Score-Guided Classification (SGC), a novel framework that uses an unsupervised anomaly score as a 'Pathological Prior' to guide EEG-based depression detection, overcoming the limi…

View →
stat.MLcs.LGEmpiricalRecentJun 24, 2026

When Does Synthetic Data Augmentation Improve Score-Based Imbalanced Classification?

Zhengchi Ma, Pengfei Lyu, Anru R. Zhang

This paper investigates the effects of synthetic data augmentation on score-based classification metrics.

View →
cs.HCcs.AIRecentMay 31, 2026

pcbGPT: Automatic PCB Schematic Synthesis from Natural Language Requirements

Tobias King, Steven Kehrberg, Michael Beigl, Tobias Röddiger

pcbGPT is a grounded system that automatically generates editable KiCad PCB schematics from natural language requirements, achieving high accuracy on complex embedded design tasks.

View →
cs.NIcs.AIRecentMay 28, 2026

Network Optimization Aspects of Autonomous Vehicles: Challenges and Future Directions

Rudolf Krecht, Tamas Budai, Erno Horvath, Akos Kovacs +2 more

This paper provides a comprehensive review of network optimization aspects for Connected and Autonomous Vehicles (CAVs), aiming to clarify misconceptions and outline future research directions.

View →
cs.DCcs.ITcs.NIEmpiricalRecentJun 19, 2026

Re-Rooting-Assisted Edge-Minimum Runtime Repair for Node and Link Failures in Dense Eisenstein--Jacobi Broadcast Networks

Bader Albader

This paper introduces a new approach to joint node/link fault recovery in dense Eisenstein--Jacobi networks.

View →
cs.AIcs.LGRecentMay 29, 2026

TIGER: Traceable Inference with Graph-Based Evidence Routing for Mitigating Hallucinations in Multimodal Generation

Kaixiang Zhao, Tianrun Yu, Shawn Huang, Porter Jenkins +2 more

TIGER is an inference-time framework that uses graph-based evidence routing to independently assess and repair unsupported facts (hallucinations) in multimodal generation.

View →