Zobrazeno 1 - 10
of 109 853
pro vyhledávání: '"And PCF"'
Panoptic lifting is an effective technique to address the 3D panoptic segmentation task by unprojecting 2D panoptic segmentations from multi-views to 3D scene. However, the quality of its results largely depends on the 2D segmentations, which could b
Externí odkaz:
http://arxiv.org/abs/2410.10659
Autor:
Leung, Chifan, Petsche, Clayton
We prove that arboreal Galois extensions of number fields are never abelian for post-critically finite rational maps and non-preperiodic base points. For polynomials, this establishes a new class of known cases of a conjecture of Andrews-Petsche. Tog
Externí odkaz:
http://arxiv.org/abs/2407.17415
Autor:
Ding, Xin1,2,3 (AUTHOR) danielxin2019@126.com, Lin, Qiao1,3 (AUTHOR) qiaolin3328@163.com, Wang, Mengjie4 (AUTHOR) 221240076@st.usst.edu.cn, Liu, Shen1,3 (AUTHOR) shenliu@szu.edu.cn, Zhang, Weiguan2,3 (AUTHOR) weigzhang@szu.edu.cn, Chen, Nan5 (AUTHOR) ntu_chennan@ntu.edu.cn, Wang, Yiping2,3 (AUTHOR)
Publikováno v:
Sensors (14248220). Sep2024, Vol. 24 Issue 18, p6118. 13p.
For each integer $d\geq 2$, let $M_d$ denote the moduli space of maps $f: \mathbb{P}^1\to \mathbb{P}^1$ of degree $d$. We study the geometric configurations of subsets of postcritically finite (or PCF) maps in $M_d$. A complex-algebraic subvariety $Y
Externí odkaz:
http://arxiv.org/abs/2405.17343
Autor:
Sato, Atsuki, Matsui, Yusuke
Sorting is one of the most fundamental algorithms in computer science. Recently, Learned Sorts, which use machine learning to improve sorting speed, have attracted attention. While existing studies show that Learned Sort is experimentally faster than
Externí odkaz:
http://arxiv.org/abs/2405.07122
Autor:
Ferdous, A. H. M. Iftekharul1 (AUTHOR), Akter, Bilkis1 (AUTHOR), Priya, A.2 (AUTHOR), Leo, L. Megalan3 (AUTHOR), Prabu, R. Thandaiah4 (AUTHOR) thandaiah@gmail.com, Sathi, Benjir Newaz1 (AUTHOR), Kundu, Diponkar1 (AUTHOR), Sadeque, Md. Golam1 (AUTHOR), Islam, Md. Shahareaj5 (AUTHOR), Ahammad, Shaik Hasane6 (AUTHOR) ahammadklu@gmail.com, Rashed, Ahmed Nabih Zaki7 (AUTHOR) ahmed_733@yahoo.com
Publikováno v:
Plasmonics. Jun2024, Vol. 19 Issue 3, p1257-1268. 12p.
Autor:
G., Melwin1 (AUTHOR), A., Devika Anil1 (AUTHOR), Krishnan, Saaveri1 (AUTHOR), S., Nivedha2 (AUTHOR), S., Praveena1 (AUTHOR), P., Ramesh Babu1 (AUTHOR), K., Senthilnathan1 (AUTHOR) senthee@gmail.com
Publikováno v:
Plasmonics. Apr2024, Vol. 19 Issue 2, p1043-1051. 9p.
Autor:
Ullah, Sajid1 (AUTHOR) sajidktkphy@gmail.com, Chen, Hailiang1 (AUTHOR) hlchen@ysu.edu.cn, Guo, Pengxiao1 (AUTHOR), Song, Mingshi1 (AUTHOR), Zhang, Sa1 (AUTHOR), Hu, Linchuan1 (AUTHOR), Li, Shuguang1 (AUTHOR) hlchen@ysu.edu.cn
Publikováno v:
Sensors (14248220). Sep2024, Vol. 24 Issue 17, p5582. 15p.
Autor:
Garti, Shimon
We obtain bounds on the cardinality of $pcf(\mathfrak{a})$ from instances of weak diamond. Consequently, under mild assumptions there are many singular cardinals of the from $\aleph_\delta$ for which $2^{\aleph_\delta}<\aleph_{(|\delta|^{+3})}$. For
Externí odkaz:
http://arxiv.org/abs/2405.03142
Intersection type systems have been independently applied to different evaluation strategies, such as call-by-name (CBN) and call-by-value (CBV). These type systems have been then generalized to different subsuming paradigms being able, in particular
Externí odkaz:
http://arxiv.org/abs/2404.14340