نتایج جستجو برای: knowledgebase completion
تعداد نتایج: 49607 فیلتر نتایج به سال:
We prove that if a paratopological group G is a continuous image of an arbitrary product of regular Lindelöf Σ-spaces, then it is R-factorizable and has countable cellularity. If in addition, G is regular, then it is totally ω-narrow and satisfies celω(G) ≤ ω, and the Hewitt–Nachbin completion of G is again an R-factorizable paratopological group.
This paper discusses the process of designing a spatial “knowledgebase” for infrastructure interdependency. Infrastructure interdependency is a new field of research that deals with interrelationships between critical infrastructure sectors in disaster management. The design and implementation of a spatial knowledgebase that mimics interrelationships between selected critical infrastructure sec...
In this paper, a state-of-the-art neuron mathematical model of neural tensor network (NTN) is proposed to RDF knowledge base completion problem. One of the difficulties with the parameter of the network is that representation of its neuron mathematical model is not possible. For this reason, a new representation of this network is suggested that solves this difficulty. In the representation, th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید