نتایج جستجو برای: set splitting problem
تعداد نتایج: 1438595 فیلتر نتایج به سال:
Operator splitting methods are often used to solve convection-diiusion problems of convection dominated nature. However, it is well known that such methods can produce signiicant (splitting) errors in regions containing self sharpening fronts. To amend this shortcoming, corrected operator splitting methods have been developed. These approaches use the wave structure from the convection step to ...
Chinese event descriptive clause splitting is the task of splitting a complex Chinese sentence into several clauses. In this paper, we present a discriminative approach for Chinese event descriptive clause splitting task. By formulating the Chinese clause splitting task as a sequence labeling problem, we apply the structured SVMs model to Chinese clause splitting. Compared with other two baseli...
Given an undirected graph G and a positive integer k, the k-vertex-connectivity augmentation problem is to find a smallest set F of new edges for which G + F is k-vertex-connected. Polynomial algorithms for this problem have been found only for k≤ 4 and a major open question in graph connectivity is whether this problem is solvable in polynomial time in general. In this paper we develop an algo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید