1 citations · 1 across the 4 of their papers we have counts for
7 papers
SPUS: A Lightweight and Parameter-Efficient Foundation Model for PDEs
Abu Bucker Siddik, Diane Oyen, Alexander Most +2
We introduce Small PDE U-Net Solver (SPUS), a compact and efficient foundation model (FM) designed as a unified neural operator for solving a wide range of partial differential equ…
Implementation of a 8-bit Wallace Tree Multiplier
Ayan Biswas, Jimmy Jin
Wallace tree multipliers are a parallel digital multiplier architecture designed to minimize the worst-case time complexity of the circuit depth relative to the input size [1]. In…
MORPH: PDE Foundation Models with Arbitrary Data Modality
Mahindra Singh Rautela, Alexander Most, Siddharth Mansingh +6
We introduce MORPH, a modality-agnostic, autoregressive foundation model for partial differential equations (PDEs). MORPH is built on a convolutional vision transformer backbone th…
Towards Reasoning for PDE Foundation Models: A Reward-Model-Driven Inference-Time-Scaling Algorithm
Siddharth Mansingh, James Amarel, Ragib Arnab +10
Partial Differential Equations (PDEs) are the bedrock for modern computational sciences and engineering, and inherently computationally expensive. While PDE foundation models have…
VizGenie: Toward Self-Refining, Domain-Aware Workflows for Next-Generation Scientific Visualization
Ayan Biswas, Terece L. Turton, Nishath Rajiv Ranasinghe +7
We present VizGenie, a self-improving, agentic framework that advances scientific visualization through large language model (LLM) by orchestrating of a collection of domain-specif…
Lost in OCR Translation? Vision-Based Approaches to Robust Document Retrieval
Alexander Most, Joseph Winjum, Ayan Biswas +4
Retrieval-Augmented Generation (RAG) has become a popular technique for enhancing the reliability and utility of Large Language Models (LLMs) by grounding responses in external doc…