نتایج جستجو برای: intersection
تعداد نتایج: 28969 فیلتر نتایج به سال:
the minimal prime decomposition for semiprime ideals is defined and studied on z-ideals of c(x). the necessary and sufficient condition for existence of the minimal prime decomposition of a z-ideal / is given, when / satisfies one of the following conditions: (i) / is an intersection of maximal ideals. (ii) i is an intersection of o , s, when x is basically disconnected. (iii) i=o , when x x ha...
sink location is considered as a basic service in geographic routing in wireless sensor networks. obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. in this paper, a sink location algorithm based on fano plane is proposed. the research challenge is how to ensure the intersection of two slq and sla rou...
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید