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...
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.
An efficient CT reconstruction framework, called edgeFBP, designed for Nvidia Jetson System-on-Chip (SoC) devices, that achieves a 1.83x speedup over the widely used RTK library on Jetson Nano and a 2.56x speedup on Jetson AGX.
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.
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...
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.
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
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
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
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.
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.
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...
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.
MIT News · Artificial Intelligence· news.mit.eduOct 2, 2026