Barham's implementation simply looks for relatively short, disjoint sequences of characters in a small set (alphanumeric plus a few others).
Barham的实现仅在一个小的集合中(字母数字加一些其它字符)查看相对较短和不相交(disjoint)的字符序列。
Yes, but it isn't immediately obvious as the set of possible MPL sequences isn't inherently disjoint from the set of callable builtin types.
是的，但这不是非常明显，因为可能的MPL序列集不是从可调用内建类型集中自然地分解出来的。
An algorithm for determining the perspective view of a set of disjoint simple objects in the plane on a two-dimensional mesh computer is presented with its time complexity given.
文中给出了二维网格结构的计算机上求平面上一组不相交简单物体透视困的算法，并给出了算法的时间复杂度。
The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.
MSS问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.
MSS问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
应用推荐