AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
Category
3,051 papers
Level graphs and strong level graphs are introduced as tools to define and compute the chromatic number of BIFGs, demonstrating that the proposed level-graph method yields exact chromatic numbers for classes of BIFGs.
We present a self-consistent hybrid global–2D model for reactor-scale simulation of SF 6 /Ar ICP etching. Unlike prior reactor-scale hybrids, which couple two spatial solvers, the framework couples a 0D global SF 6 /Ar chemistry solver to a 2D axisymmetric electromagnetic and species-transport solver through a...
We study the formation and interaction of dispersive shock waves (DSWs) in the two-dimensional Toda lattice subject to wedge-type initial conditions, and show that their interaction gives rise to a discrete analog of Mach reflection for dispersive shock waves in discrete systems. The initial jump across each leg of the...
Tuning the reservoir Hamiltonian and the evolution time with Bayesian optimization at each encoding length, it is found that recurrent quantum memory is essential when a task must reach far into the past, and dispensable when the relevant history is short, where the memoryless reset limit already suffices.
Reach audiences
Advertise in front of researchers, engineers, and readers.
This work develops a multi-agent proximal policy optimization (MAPPO) algorithm to achieve a long-term optimal tradeoff between energy consumption and latency and demonstrates that under identical hyperparameter settings and training episodes, MAPPO achieves stable convergence and outperforms other MADRL baselines.
Video large language models (VLLMs) enable powerful multimodal reasoning but face severe efficiency challenges on edge devices due to the massive computational and memory demands caused by lengthy video-token sequences. Existing methods struggle to efficiently compress spatiotemporally redundant tokens while minimizing...
On graph discrimination it is proved a matching limitation: on graphs where every edge sees the same number of shortest cycles of the same length, the descriptor becomes constant and any model built on it collapses back to the 1-WL bound.
DronesCATS-Agent, an architecture where the MLLM is a swappable component, and DroneCATS, a benchmark treating the model as the independent variable are introduced, an architecture where the MLLM is a swappable component and DroneCATS, a benchmark treating the model as the independent variable.
Workload Aware Column Imprint-Hash Join WACI-HJ is presented, which uses a workload-aware approach to accelerate hash joins and shows 1%, 38%, and 49% gain in CPU, RAM, and I/O, respectively.
The goal of this research is to investigate and develop embedded architectures for edge computing applications. The project targets HW/SW hybrid platforms, composed of FPGA logic coupled with embedded processors, and focuses on two aspects which are critical to IoT sensor-based settings. On the one hand, it involves th...
A randomized combinatorial algorithm that solves MSRP on unweighted directed graphs in $\tilde{O}(m\sqrt{\sigma n} + \sigma n^2)$ time, with all the output distances correct with high probability.
DETR, an end-to-end detector derived from the Real-Time Detection Transformer, combines efficient local feature extraction with partial-channel global interaction to improve multi-scale representation while reducing the parameter count of the backbone.
Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
Education Innovation
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar 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.
