Zobrazeno 1 - 10
of 95 422
pro vyhledávání: '"Ola, A."'
Autor:
Singh, Anupam K., Singh, Sanjay, Dubey, Krishna K., Devi, Parul, Das, Pritam, Etter, Martin, Grendal, Ola. G., Dejoie, Catherine, Fitch, Andrew, Senyshyn, Anatoliy, Lee, Seung-Cheol, Bhattacharjee, Satadeep, Pandey, Dhananjai
Dzyaloshinskii-Moriya interaction (DMI) plays a crucial role to stabilize the exotic topologically stable skyrmion spin-textures in the noncentrosymmetric crystals. The recent discovery of biskyrmions and skyrmions in the globally centrosymmetric cry
Externí odkaz:
http://arxiv.org/abs/2412.09158
We extend the buckling and clamped-plate problems to the context of differential forms on compact Riemannian manifolds with smooth boundary. We characterize their smallest eigenvalues and prove that, in the case of Euclidean domains, their spectra on
Externí odkaz:
http://arxiv.org/abs/2412.05612
The remarkable performance of large language models (LLMs) in content generation, coding, and common-sense reasoning has spurred widespread integration into many facets of society. However, integration of LLMs raises valid questions on their reliabil
Externí odkaz:
http://arxiv.org/abs/2412.05563
Autor:
Shangguan, Zhongkai, Huang, Zanming, Ohn-Bar, Eshed, Ozernov-Palchik, Ola, Kosty, Derek, Stoolmiller, Michael, Fien, Hank
Models for student reading performance can empower educators and institutions to proactively identify at-risk students, thereby enabling early and tailored instructional interventions. However, there are no suitable publicly available educational dat
Externí odkaz:
http://arxiv.org/abs/2412.10401
Autor:
Dütting, Paul, Fusco, Federico, Lattanzi, Silvio, Norouzi-Fard, Ashkan, Svensson, Ola, Zadimoghaddam, Morteza
In this work, we study online submodular maximization, and how the requirement of maintaining a stable solution impacts the approximation. In particular, we seek bounds on the best-possible approximation ratio that is attainable when the algorithm is
Externí odkaz:
http://arxiv.org/abs/2412.02492
Autor:
Drygala, Marina, Lattanzi, Silvio, Maggiori, Andreas, Stouras, Miltiadis, Svensson, Ola, Vassilvitskii, Sergei
In this paper, we consider a new problem of portfolio optimization using stochastic information. In a setting where there is some uncertainty, we ask how to best select $k$ potential solutions, with the goal of optimizing the value of the best soluti
Externí odkaz:
http://arxiv.org/abs/2412.00717
We present FAST-Splat for fast, ambiguity-free semantic Gaussian Splatting, which seeks to address the main limitations of existing semantic Gaussian Splatting methods, namely: slow training and rendering speeds; high memory usage; and ambiguous sema
Externí odkaz:
http://arxiv.org/abs/2411.13753
Autor:
He, Zihong, Lin, Weizhe, Zheng, Hao, Zhang, Fan, Jones, Matt, Aitchison, Laurence, Xu, Xuhai, Liu, Miao, Kristensson, Per Ola, Shen, Junxiao
With the rapid advancement of AI systems, their abilities to store, retrieve, and utilize information over the long term - referred to as long-term memory - have become increasingly significant. These capabilities are crucial for enhancing the perfor
Externí odkaz:
http://arxiv.org/abs/2411.00489
Artificial Intelligence-Generated Content (AIGC) has the potential to transform how people build and interact with virtual environments. Within this paper, we discuss potential benefits but also challenges that AIGC has for the creation of inclusive
Externí odkaz:
http://arxiv.org/abs/2410.23803
We present DisCo, a distributed algorithm for contact-rich, multi-robot tasks. DisCo is a distributed contact-implicit trajectory optimization algorithm, which allows a group of robots to optimize a time sequence of forces to objects and to their env
Externí odkaz:
http://arxiv.org/abs/2410.23283