نتایج جستجو برای: cut set
تعداد نتایج: 725343 فیلتر نتایج به سال:
Poljak, S. and D. Turzik, Max-cut in circulant graphs, Discrete Mathematics 108 (1992) 379-392. We study the max-cut problem in circulant graphs C,,,, where C,,, is a graph whose edge set consists of a cycle of length n and all the vertex pairs of distance r on the cycle. An efficient solution of the problem is obtained so that we show that there is always a maximum cut of a particular shape, c...
Given a deenite logic program with cut, we proceed in two steps to give it a semantics. First, we delete cut from the program, and construct the basic action theory for the resulting cut-free program in the situation calculus according to (Lin and Reiter 3]). We then formalize the eeects of cut by adding to the basic action theory a situation calculus sentence that characterizes the set of situ...
در این پایان نامه رسته کلیسلی setpو رسته ریخت جزئی setمعرفی شده و الحاق هایی بین رسته های set، set وریخت جزئیset بدست آورده ایم. همچنین به مطالعه وجود ضرب ، معادلساز و عقب بر در رسته کلیسلی پرداخته ایم. نشان داده ایم ضرب در این رسته وجود دارد. برای وجود معادلساز شرایط لازم وکافی را بدست آورده و نتیجه را به وجود عقب بر و نهایتاً حد ، بطور کلی تسری داده ایم.
In this paper, a new Fuzzy Morphology (FM) based on the GeneralizedDempster-Shafer Theory (GDST) is proposed. At first, in order to clarify the similarity ofdefinitions between Mathematical Morphology (MM) and Dempster-Shafer Theory (DST),dilation and erosion morphological operations are studied from a different viewpoint. Then,based on this similarity, a FM based on the GDST is proposed. Unlik...
Given a directed graph G, a set of k terminals and an integer p, the Directed Vertex Multiway Cut problem asks if there is a set S of at most p (nonterminal) vertices whose removal disconnects each terminal from all other terminals. Directed Edge Multiway Cut is the analogous problem where S is a set of at most p edges. These two problems indeed are known to be equivalent. A natural generalizat...
LP relaxation based message passing and flow-based algorithms are two of the popular techniques for performing MAP inference in graphical models. Generic Cuts (GC) (Arora et al., 2015) combines the two approaches to generalize the traditional max-flow min-cut based algorithms for binary models with higher order clique potentials. The algorithm has been shown to be significantly faster than the ...
Background & Objective: Mild cognitive impairment (MCI) is a transient state between normal condition and dementia. Available data indicates that coronary artery diseases (CAD) may increase the risk of MCI. Hence, the early detection of MCI can prevent the progression of cognitive decline. Materials & Methods: A sample of 65 subjects with degrees of CAD was enrolled to the study. For cogniti...
We identify multirole logic as a new form of logic in which conjunction/disjunction is interpreted as an ultrafilter on the power set of some underlying set (of roles) and the notion of negation is generalized to endomorphisms on this underlying set. We formalize both multirole logic (MRL) and linear multirole logic (LMRL) as natural generalizations of classical logic (CL) and classical linear ...
Consider a network of pipes joining a set of intakes (the source) to a separate set of outlets (the e n sink), so that liquid flows from the intakes, through the network, to the outlets. A cross-section of th etwork, separating the intakes on one side from the outlets on the other, is called a cut. A minimal t c cut is one that, roughly speaking, slices through a set of pipes whose combined cap...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید