نتایج جستجو برای: gamma open set
تعداد نتایج: 1134370 فیلتر نتایج به سال:
Let $\\Omega \\subset \\mathbb{R}^d$ be a bounded open set with Lipschitz boundary $\\Gamma$. It will shown that the Jordan chains of m-sectorial second-order elliptic partial differential operators measurable coefficients and (local or non-local) Robin conditions in $L_2(\\Omega)$ can characterized help Dirichlet-to-Neumann map operator from $H^{1/2}(\\Gamma)$ into $H^{-1/2}(\\Gamma)$. This re...
in this text we prove that in generalized shift dynamical system $(x^gamma,sigma_varphi)$ for finite discrete $x$ with at least two elements, infinite countable set $gamma$ and arbitrary map $varphi:gammatogamma$, the following statements are equivalent: - the dynamical system $(x^gamma,sigma_varphi)$ is li-yorke chaotic; - the dynamical system $(x^gamma,sigma_varphi)$ has an scr...
In this text we prove that in generalized shift dynamical system $(X^Gamma,sigma_varphi)$ for finite discrete $X$ with at least two elements, infinite countable set $Gamma$ and arbitrary map $varphi:GammatoGamma$, the following statements are equivalent: - the dynamical system $(X^Gamma,sigma_varphi)$ is Li-Yorke chaotic; - the dynamical system $(X^Gamma,sigma_varphi)$ has an scr...
Often, when dealing with real-world recognition problems, we do not need, and often cannot have, knowledge of the entire set possible classes that might appear during operational testing. In such cases, need to think robust classification methods able deal "unknown" properly reject samples belonging never seen training. Notwithstanding, existing classifiers date were mostly developed for closed...
The non-commuting graph $Gamma(G)$ of a non-abelian group $G$ with the center $Z(G)$ is a graph with thevertex set $V(Gamma(G))=Gsetminus Z(G)$ and two distinct vertices $x$ and $y$ are adjacent in $Gamma(G)$if and only if $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.
a set $s$ of vertices in a graph $g$ is a dominating set if every vertex of $v-s$ is adjacent to some vertex in $s$. the domination number $gamma(g)$ is the minimum cardinality of a dominating set in $g$. the annihilation number $a(g)$ is the largest integer $k$ such that the sum of the first $k$ terms of the non-decreasing degree sequence of $g$ is at most the number of edges in $g$. in this p...
开放环境下的模式识别与文字识别应用中,新数据、新模式和新类别不断涌现,要求算法具备应对新类别模式的能力。针对这一问题,研究者们开始聚焦开放集文字识别(open-set text recognition,OSTR)任务。该任务要求,算法在测试(推断)阶段,既能识别训练集见过的文字类别,还能够识别、拒识或发现训练集未见过的新文字。开放集文字识别逐步成为文字识别领域的研究热点之一。本文首先对开放集模式识别技术进行简要总结,然后重点介绍开放集文字识别的研究背景、任务定义、基本概念、研究重点和技术难点。同时,针对开放集文字识别三大问题(未知样本发现、新类别识别和上下文信息偏差),从方法的模型结构、特点优势和应用场景的角度对相关工作进行了综述。最后,对开放集文字识别技术的发展趋势和研究方向进行了分析展望。;Text recognition is focused on transcription-...
In traditional semantic segmentation, knowing about all existing classes is essential to yield effective results with the majority of approaches. However, these methods trained in a Closed Set fail when new are found test phase, not being able recognize that an unseen class has been fed. This means they suitable for Open scenarios, which very common real-world computer vision and remote sensing...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید