نتایج جستجو برای: bipartite set intersection representation

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

Journal: :archives of razi institute 0

ontology is a requirement engineering product and the key to knowledge discovery. it includes the terminology to describe a set of facts, assumptions, and relations with which the detailed meanings of vocabularies among communities can be determined. this is a qualitative content analysis research. this study has made use of ontology for the first time to discover the knowledge of vaccine in ir...

Journal: :Proceedings on Privacy Enhancing Technologies 2019

Journal: :ACM Transactions on Privacy and Security 2018

2008
Britta Hummel Werner Thiemann Irina Lulcheva

Road recognition from video sequences has been solved robustly only for small, often simplified subsets of possible road configurations. This contribution argues for a massive augmentation of the amount of prior knowledge to enable the development of more generally applicable estimators. Description Logic is introduced as an expressive knowledge representation formalism for scene understanding....

Journal: :J. Comb. Theory, Ser. A 2013
M. Cámara Cristina Dalfó Charles Delorme Miguel Angel Fiol H. Suzuki

A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph Γ is distance-regular and homogeneous. More precisely, Γ is edge-distance-regular if and only if it is bipartite distance-reg...

ژورنال: پژوهش های ریاضی 2022

Let R be a commutative ring with identity and Nil(R) be the set of nilpotent elements of R. The nil-graph of ideals of R is defined as the graph AG_N(R) whose vertex set is {I:(0)and there exists a non-trivial ideal  such that  and two distinct vertices  and  are adjacent if and only if . Here, we study conditions under which  is complete or bipartite. Also, the independence number of  is deter...

Journal: :Applied Mathematics and Computation 2013
Jonathan D. Hauenstein Charles W. Wampler

The fundamental construct of numerical algebraic geometry is the representation of an irreducible algebraic set, A, by a witness set, which consists of a polynomial system, F , for which A is an irreducible component of V(F ), a generic linear space L of complementary dimension to A, and a numerical approximation to the set of witness points, L ∩A. Given F , methods exist for computing a numeri...

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

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