Zobrazeno 1 - 10
of 33 363
pro vyhledávání: '"A Maheshwari"'
Autor:
Neelam, Maheshwari, Hain, Christopher
Modern climate change presents unprecedented challenges, posing critical crises that threaten sustainable development, human well-being, and planetary health. A significant concern is the potential for global warming to cause irreversible disruptions
Externí odkaz:
http://arxiv.org/abs/2410.11049
Autor:
Aloupis, Greg, Biniaz, Ahmad, Bose, Prosenjit, De Carufel, Jean-Lou, Eppstein, David, Maheshwari, Anil, Odak, Saeed, Smid, Michiel, Tóth, Csaba D., Valtr, Pavel
Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short geometric structures such as shortest perfect matchings, shortest spa
Externí odkaz:
http://arxiv.org/abs/2410.05580
Cops and Robbers is a type of pursuit-evasion game played on a graph where a set of cops try to capture a single robber. The cops first choose their initial vertex positions, and later the robber chooses a vertex. The cops and robbers make their move
Externí odkaz:
http://arxiv.org/abs/2409.16279
We introduce MoRAG, a novel multi-part fusion based retrieval-augmented generation strategy for text-based human motion generation. The method enhances motion diffusion models by leveraging additional knowledge obtained through an improved motion ret
Externí odkaz:
http://arxiv.org/abs/2409.12140
Automatic Speech Recognition (ASR) systems have achieved remarkable performance on widely used benchmarks such as LibriSpeech and Fleurs. However, these benchmarks do not adequately reflect the complexities of real-world conversational environments,
Externí odkaz:
http://arxiv.org/abs/2409.12042
Large language models (LLMs) have enabled a range of applications in zero-shot and few-shot learning settings, including the generation of synthetic datasets for training and testing. However, to reliably use these synthetic datasets, it is essential
Externí odkaz:
http://arxiv.org/abs/2409.11968
In 1988, Erd\H{o}s suggested the question of minimizing the number of edges in a connected $n$-vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In this paper,
Externí odkaz:
http://arxiv.org/abs/2409.11216
In this article, we present an approximation algorithm for solving the Weighted Region Problem amidst a set of $ n $ non-overlapping weighted disks in the plane. For a given parameter $ \varepsilon \in (0,1]$, the length of the approximate path is at
Externí odkaz:
http://arxiv.org/abs/2409.08869
In this paper, we define a tempered space-time fractional negative binomial process (TSTFNBP) by subordinating the fractional Poisson process with an independent tempered Mittag-Leffler L\'{e}vy subordinator. We study its distributional properties an
Externí odkaz:
http://arxiv.org/abs/2409.07044
As mental health care systems worldwide struggle to meet demand, there is increasing focus on using language models to infer neuropsychiatric conditions or psychopathological traits from language production. Yet, so far, this research has only delive
Externí odkaz:
http://arxiv.org/abs/2409.15323