نتایج جستجو برای: pairwise almost co
تعداد نتایج: 546073 فیلتر نتایج به سال:
We investigate the task of medical concept coreference resolution in clinical text using two semi-supervised methods, co-training and multi-view learning with posterior regularization. By extracting semantic and temporal features of medical concepts found in clinical text, we create conditionally independent data views; co-training MaxEnt classifiers on this data works almost as well as supervi...
in this paper, we generalize a theorem of shao [12] by assuming that is a sequence of linear negatively dependent random variables. also, we extend some theorems of chao [6] and thrum [14]. it is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of real numbe...
The aim of the present paper is to characterize almost co-K?hler manifolds whose metrics are Riemann solitons. At first we provide a necessary and sufficient condition for metric 3-dimensional manifold be soliton. Next it proved that if an soliton with vector field ?, then flat. It also shown (?, ?)-almost ? < 0 soliton, expanding satisfies relation. We prove there does not exist gradient so...
Graph Neural Networks (GNNs) have proven to be effective in processing and learning from graph-structured data. However, previous works mainly focused on understanding single graph inputs while many real-world applications require pair-wise analysis for data (e.g., scene matching, code searching, drug-drug interaction prediction). To this end, recent shifted their focus the between pairs of gra...
We prove that the braid group on 4 or more strands modulo its center is co-Hopfian. We then show that any injective endomorphism of these braid groups is geometric in the sense that it is induced by a homeomorphism of a punctured disk. We further prove that any injection from the braid group on n strands to the braid group on n + 1 strands is geometric (n ≥ 7). Additionally, we obtain related r...
Let ‖z‖ 3 √ 2 be arbitrary. The goal of the present article is to derive graphs. We show that Borel’s condition is satisfied. The groundbreaking work of C. Sasaki on quasi-Maxwell–Ramanujan equations was a major advance. This could shed important light on a conjecture of Boole.
A tournament is a binary dominance relation on a set of alternatives. Tournaments arise in many contexts that are relevant to AI, most notably in voting (as a method to aggregate the preferences of agents). There are many works that deal with choice rules that select a desirable alternative from a tournament, but very few of them deal directly with incentive issues, despite the fact that gameth...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید