Zobrazeno 1 - 10
of 982
pro vyhledávání: '"A. Sahami"'
Publikováno v:
Journal of Mathematics, Vol 2023 (2023)
In this paper, we study an approximate biflatness of l1S, where S is a Clifford semigroup. Indeed, we show that a Clifford semigroup algebra l1S is approximately biflat if and only if every maximal subgroup of S is amenable, ES is locally finite, and
Externí odkaz:
https://doaj.org/article/f1b930df26b14da7b7da3c62074bfe30
User-generated videos (UGVs) uploaded from mobile phones to social media sites like YouTube and TikTok are short and non-repetitive. We summarize a transitory UGV into several keyframes in linear time via fast graph sampling based on Gershgorin disc
Externí odkaz:
http://arxiv.org/abs/2408.01859
Autor:
Harvey, Nicholas, Sahami, Arvin
Orthogonal arrays are a type of combinatorial design that were developed in the 1940s in the design of statistical experiments. In 1947, Rao proved a lower bound on the size of any orthogonal array, and raised the problem of constructing arrays of mi
Externí odkaz:
http://arxiv.org/abs/2405.08787
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
In the present paper, we study the approximate biprojectivity and weak approximate biprojectivity of ℓ1-Munn Banach algebras when the related sandwich matrix is regular over InvA. In fact, we show that a ℓ1-Munn Banach algebra with the regular sa
Externí odkaz:
https://doaj.org/article/e96fbe7e506f4dc5802156c1f985e86f
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
In this study, we show that a matrix algebra ℒℳIpA is a dual Banach algebra, where A is a dual Banach algebra and 1≤p≤2. We show that ℒℳIpℂ is Connes amenable if and only if I is finite, for every nonempty set I. Additionally, we prove
Externí odkaz:
https://doaj.org/article/bf9341ec592042c28add28421c4b2676
Autor:
Nie, Allen, Chandak, Yash, Suzara, Miroslav, Ali, Malika, Woodrow, Juliette, Peng, Matt, Sahami, Mehran, Brunskill, Emma, Piech, Chris
Large language models (LLMs) are quickly being adopted in a wide range of learning experiences, especially via ubiquitous and broadly accessible chat interfaces like ChatGPT and Copilot. This type of interface is readily available to students and tea
Externí odkaz:
http://arxiv.org/abs/2407.09975
While the use of programming problems on exams is a common form of summative assessment in CS courses, grading such exam problems can be a difficult and inconsistent process. Through an analysis of historical grading patterns we show that inaccurate
Externí odkaz:
http://arxiv.org/abs/2403.14637
Autor:
Sahami, Masoud, Ghassemi, Hojat
Publikováno v:
In Chemical Engineering and Processing - Process Intensification September 2024 203
Autor:
Sahami, Masoud, Ghassemi, Hojat
Publikováno v:
In Advances in Space Research 1 September 2024 74(5):2405-2423
Publikováno v:
In Current Problems in Cardiology August 2024 49(8)