1,370+ open-access research outputs.
Let $G=PSL(n,\mathbb{C})$. Let $T$ be a maximal torus of $G$. Let $\omega_{r}$ denote the $r^{th}$ fundamental weight. Let $\mathcal{L}(n\omega_{r})$ denote the line bundle on the Grassmannian $G_{r,n…
We develop a unified T-extended framework for weakly contractive, weakly Kannan, and Geraghty classes of self-maps S on a metric space (X, d), where distances are measured on the auxiliary image via d…
We present Code Broker, a multi agent system built with Google Agent Development Kit ADK that analyses Python code from files, local directories, or GitHub repositories and generates actionable qualit…
Large Language Models (LLMs) have achieved impressive results on public benchmarks, often leading to claims of advanced reasoning and understanding. However, recent research in cognitive science revea…
Large enterprises often operate extensive Continuous Integration (CI) pipelines on large, heterogeneous compute clusters, where conservative, statically defined resource requirements are used to ensur…
Many visual monitoring systems operate under strict communication constraints, where transmitting full-resolution images is impractical and often unnecessary. In such settings, visual data is often us…
Advancements in Artificial Intelligence (AI) technologies' social fluency are being integrated into commercial interactions. As tools such as OpenAI's assistant are integrated into platforms such as S…
Natural language processing (NLP) and speech technologies have made significant progress in recent years; however, they remain largely focused on standardized language varieties. Dialects, despite the…
Retrieving relevant observations from long multi-modal web interaction histories is challenging because relevance depends on the evolving task state, modality (screenshots, HTML text, structured signa…
We prove that the flow-cut gap for $n$-node directed graphs is at most $n^{1/3 + o(1)}$. This is the first improvement since a previous upper bound of $\widetilde{O}(n^{11/23})$ by Agarwal, Alon, and …
The paper extends the Scaled Relative Graph (SRG) framework of Ryu, Hannah, and Yin from Hilbert spaces to normed spaces. Our extension replaces the inner product with a regular pairing, whose asymmet…
Standard macroeconomic frameworks have correctly identified Japan's government debt - now exceeding 240% of GDP - as carrying substantial fiscal risk. Yet FRED data from 2013 to 2026 present an empiri…
Random subsampling of edges is a commonly employed technique in graph algorithms, underlying a vast array of modern algorithmic breakthroughs. Unfortunately, using this technique often leads to random…
We release Samas\=amayik, a novel, meticulously curated, large-scale Hindi-Sanskrit corpus, comprising 92,196 parallel sentences. Unlike most data available in Sanskrit, which focuses on classical era…
Ghana faces a residential housing deficit of two million units. A key driver of project failure is the "completeness gap", a systematic discrepancy between informal contractor quotes and actual costs.…
We derive new formulas for the Jones polynomial and the Kauffman bracket polynomial of a rational link represented by a standard diagram that is not necessarily alternating. These formulas generalize …
State Space Models (SSMs), especially recent Mamba architecture, have achieved remarkable success in sequence modeling tasks. However, extending SSMs to computer vision remains challenging due to the …
Current instruction-guided video editing models struggle to simultaneously balance precise semantic modifications with faithful motion preservation. While existing approaches rely on injecting explici…
Multimodal Large Language Models have achieved strong performance in single-video understanding, yet their ability to reason across multiple videos remains limited. Existing approaches typically conca…
This paper presents novel refinement sensors for the application to adaptive mesh and algorithm refinement (AMAR) with kinetic models, such as discrete velocity and lattice Boltzmann methods. While re…
Free open-access publishing with Google Scholar indexing.
Submission Guide →