Category
2,851 papers
pysurfacefun 2.0.0 rebuilds the solver core. Code written for 1.0.1 should run without changes: the 1.0.1 test suite passes on 2.0.0 unmodified. What's new Quadrilateral and triangular patches now share one HPS fast direct solver, and its merges follow a nested dissection of the patch graph. On the Rhino cow mesh (339...
Research package supporting the article "SPARF: Seasonal Profile-Assisted Ridge Forecasting for Proactive Resource Hotspot Prediction in Edge Computing" (J.-P. Yang), prepared for submission to Computer Networks. It contains the experiment programs, the locked evaluation protocol, VM roles and data hashes, saved baseli...
Supplementary code and materials for 'SurfaceRecipe: Information-Efficient Mesh Surface Representation for Lightweight 3-D Shape Classification' (submitted to Computers and Graphics). SurfaceRecipe is a lightweight, mesh-informed 3-D shape classifier organised around a continuous geometric evidence signal. It builds fi...
Research package supporting the article "SPARF: Seasonal Profile-Assisted Ridge Forecasting for Proactive Resource Hotspot Prediction in Edge Computing" (J.-P. Yang), prepared for submission to Computer Networks. It contains the experiment programs, the locked evaluation protocol, VM roles and data hashes, saved baseli...
Reach audiences
Advertise in front of researchers, engineers, and readers.
This paper presents a comparative analysis of MobileNetV2 and EfficientNetB0 for face and fingerprint recognition in amachine learning-enhanced access control system. The study was developed within an edge computing security frameworkwhere biometric verification was integrated with contextual risk analysis and Chinese...
For n >= 0, let G_n = {0,1,...,n}^3. This note studies the number a(n) of Euclidean congruence classes of nondegenerate triangles whose vertices lie in G_n, the three-dimensional analogue of the square-grid sequence A028419. An exact finite encoding is obtained from the 3*n*(n+1)/2 + 1 possible one-coordinate contribut...
Resource-constrained edge devices increasingly require local AI inference while providing limited memory, storage, compute capability, and operating-system support. This paper presents a cartridge-oriented architecture in which model-specific inference information is packaged as a compact, validated artifact executed b...
# Phantom Vision Lab — a computational instrument for perturbing an image-analysis pipeline and measuring how its output changes **A deterministic structured-light stimulus generator paired with a fixed classical computer-vision pipeline, used to measure how much the pipeline's own output moves when 11 computational pa...
pysurfacefun 2.0.0 rebuilds the solver core. Code written for 1.0.1 should run without changes: the 1.0.1 test suite passes on 2.0.0 unmodified. What's new Quadrilateral and triangular patches now share one HPS fast direct solver, and its merges follow a nested dissection of the patch graph. On the Rhino cow mesh (339...
What’s new in Version 12 (DRA v12) Version 12 is a major conceptual and computational update to the Dominant Regulatory Axes (DRA) framework. It introduces a strengthened formulation of the Law of Regulatory Transitions, a fully patched and diagnostically robust v10 pipeline, and the first worked example demonstrating...
From Covering-Edge Descent Complexes to Functorial Presheaves and Coherence Defects (PO-001) Subtitle: Strict Functorial Completion, Coboundary-Curvature Duality, and the Finite Obstruction Boundary Abstract Covering-edge descent data on a finite poset assigns restriction maps only to adjacent comparable elements. A st...
Phase 2 of the October 2026 codebase review: the structural work that makes adding a new CaLab web app a single command (npm run new-app -- ). Shared UI is backend-free, per-app config is three lines, app identity comes from one calab.id field, a build-time apps.json manifest drives the landing page and the Python brid...
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.
By rethinking how large cloud computing systems operate, Associate Professor Christina Delimitrou seeks to make data centers more energy efficient.
A Blog post by Liquid AI on Hugging Face
An ongoing survey tracks the latest AI accelerator systems to keep hardware relevant for Lincoln Laboratory staff and sponsors.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
