نتایج جستجو برای: hard for mspps

تعداد نتایج: 10387245  

Journal: :Journal of Mathematical Imaging and Vision 2013

Journal: :Journal of the European Mathematical Society 2021

We prove the relative hard Lefschetz theorem for Soergel bimodules. It follows that structure constants of Kazhdan–Lusztig basis are unimodal. explain why implies tensor category associated by Lusztig to any two-sided cell in a Coxeter group is rigid and pivotal.

Journal: :Knowledge Based Systems 2021

Domain adaptation (DA) aims to transfer knowledge from a label-rich and related domain (source domain) label-scare (target domain). Pseudo-labeling has recently been widely explored used in DA. However, this line of research is still confined the inaccuracy pseudo labels. In paper, we explore imbalance issue performance among classes in-depth observe that worse performances all are likely furth...

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

Journal: :Transactions of the American Mathematical Society 2018

Journal: :Journal of the Surface Finishing Society of Japan 1989

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید