Category
2,978 papers
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.
Reach audiences
Advertise in front of researchers, engineers, and readers.
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.
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.
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.
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...
This paper presents a labeling scheme that uses $O(\log^{2}n)$-bit labels that can be computed in deterministic polynomial time and is the first labeling scheme that produces an $\tilde{O}(1)$-size labeling which is simultaneously correct across all queries.
The first sublinear approximation algorithm for the minimum dilation tree in the Euclidean plane is given, whose approximation ratio is $\tilde{O}(n^{14/15})$ and the algorithm runs in polynomial time.
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.
