Skip to content

Category

edge computing

2,572 papers

#edge computing Preprint Sep 2026

Complexes of strong discrete Morse matchings

Using the strong discrete Morse theory developed by Fern\'andez, we define the complex $\mathcal{SM}(K)$ of strong discrete Morse matchings on a simplicial complex $K$, as well as the pure subcomplex $\mathcal{SM}_{pure}(K)$ generated by the facets in $\mathcal{SM}(K)$ of maximal dimension. For most complexes $K$ these...

Unknown authors · 0 citations
#edge computing Preprint Sep 2026

Computing and Bounding the Number of Eulerian Orientations for Certain Classes of $4$-Regular Graphs

The bounds on the number of Eulerian orientations for certain classes of connected, loopless $4-regular graphs are improved and a divide-and-conquer algorithm is provided that leverages structural properties to compute the exact number of Eulerian orientations for separable graphs without exhaustive enumeration.

Evangelos Bartzos, Michalis Samaris · 1 citation
#edge computing Preprint Sep 2026

Unified AI Gateway: A Framework for Joint Model Routing and KV Cache Management

This work defines and analyzes the Unified AI Gateway as a system setting for an edge-deployed AI traffic hub that coordinates model routing, KV cache management, and compute placement across end devices, edge resources, and cloud model services.

Jia-Xun Lu, Xiang Zhang, Yun-Feng Shao · 1 citation
#edge computing Preprint Sep 2026

Lengths and incidences in Poisson hypersphere and spherical splitting tessellations

We investigate distributional properties of two random tessellation models on the $d$-dimen\-sional unit sphere. First, we analyze the Poisson hypersphere tessellation generated by a Poisson process on the space of hyperspheres. We derive an explicit formula for the length distribution of its typical edge. Second, we t...

Unknown authors · 0 citations
#edge computing Preprint Sep 2026

Automatic constraints with few subpowers and graphoid recognition

For graphoid automata, these results give polynomial-time recognition without a graph-width restriction, effective boundary composition, and comparison of finite graph relations, and the quadratic boundary bounds are optimal in the worst case.

Antonios Kalampakas · 0 citations
#edge computing Preprint Sep 2026

ComVLA: Communication-Aware Split Inference for VLA Models in 6G-Connected Robotics

ComVLA is proposed, a framework that uses the dense semantic information contained in the language guidance to adapt the VLA token budget to the channel capacity, and demonstrates that co-designing VLA inference and wireless communication is a practical direction for 6G-connected robotics.

Bo-Liang Liu, Wint Yi Poe, Jing-Yun Di et al. · 0 citations
#edge computing Preprint Sep 2026

Determinants of hyperparameter robustness in connectome reservoir computing

To examine the architectural determinants of robustness, perturbations that alter connectivity topology, excitatory/inhibitory sign structure, weight magnitudes, and weight placement are constructed while preserving complementary properties.

Miles Walter Churchland, R. de Palma Aristides, Jordi Garcia-Ojalvo et al. · 0 citations
#edge computing Preprint Sep 2026

A simple algorithm for computing Hamilton paths on independent set polytopes

These algorithms bypass solving the computationally intractable maximum weight independent set problem by solving the computationally intractable maximum weight independent set problem by a simple and purely combinatorial greedy rule.

Jean Cardinal, Pia Herkenrath, Torsten Mütze et al. · 0 citations
#edge computing Preprint Sep 2026

AI-Native Orchestration in the 6G Continuum: Evolving Operator Platforms with Agentic AI

An agentic OP framework autonomously reconciles stringent Service Level Agreements (SLAs) while enhancing infrastructure energy efficiency and establishing a scalable blueprint for cross-domain Network-as-a-Service (NaaS) models that align standardised exposure with 6G autonomous requirements.

Claudia Carballo González, Hatim Chergui, Sergio Giménez-Antón et al. · 0 citations
#edge computing Preprint Sep 2026

Width-Bounded Equational Derivations for Finite Graph Expressions

It is proved that equal closed expressions of pattern width at most $k$ are joined by a derivation in which every step applies an equation in either direction and every intermediate width is at most a computable $B_\Sigma(k)$, independently of graph size.

Antonios Kalampakas · 0 citations
#edge computing Preprint Sep 2026

Topological Impurity Bands

The effects of disorder on topological phases of matter are typically either preservation of topology or its destruction. For example, the quantum Hall effect's quantization and chiral edge mode remain robust until a strong-disorder percolation transition exits the topological phase. Disorder can also enlarge a preexis...

Arnab Seth, I. Kimchi · 0 citations

From tech blogs

See all →
Microsoft Research Blog Oct 6, 2026

What AI gets wrong and what failure teaches us

Jennifer Neville did not want to go into computer science—but that’s exactly where she landed. Neville discusses the starts and stops that led to her professional sweet spot and her work identifying “surprising failures” making it hard for AI to handle complexity.  The post What AI gets wrong and what failure teaches us appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.