One of the most important questions in quantum information theory is the so-called separability problem. It involves characterizing the set of separable (o... Micha Oszmaniec - 《Physics》 被引量: 6发表: 2014年 Applications of the Relative Neighbourhood Graph The relative neighborhood graph of a...
graph theoryrandom processes/ graph convergencefuzzy-valued random variablesHausdorff metricKuratowski-Mosco topologyfuzzy set theory/ B0250 Combinatorial mathematics C1160 Combinatorial mathematicsWe prove that the graph convergence in Hausdorff metric or Kuratowski–Mosco topology of a sequence of fuzzy sets...
Specification of objectives constitutes a central issue in knowledge representation for planning. Decision-theoretic approaches require that representation... MP Wellman,J Doyle 被引量: 151发表: 1994年 Separability generalizes Dirac's theorem To insure a linear-time access to a moplex in any graph,...
Graph Embedding: A General Framework for Dimensionality Reduction In the last decades, a large family of algorithms - supervised or unsupervised; stemming from statistic or geometry theory - have been proposed to provide ... S Yan,X Dong,B Zhang,... - IEEE Computer Society Conference on ...
Subgroup separability of graphs of nilpotent groups. Necessary and sufficient conditions are given for the subgroup separability of the fundamental group of a finite graph of groups with finitely generated ni... Metaftsis,V.,Raptis,... - 《Journal of Group Theory》 被引量: 9发表: 2004年 ...
The separability condition for the RLC network over the field Fz of rational functions in multi-parameters is derived. Some criteria and technique are proposed to check the reducibility of the characteristic polynomial of the network. The technique is straightforward since it is only necessary to ...
We find f i and U i by walking the graph for f. In doing so, we accumulate linear terms (rows of a U i) as long as possible — until they appear in a nonlinear operation. Having found a linear term, we put it into a canonical form, sorting its coefficients and scaling them so...
AnS-ring (a Schur ring) is said to beseparablewith respect to a class of groups{\mathcal {K}}if every algebraic isomorphism from theS-ring in question to anS-ring over a group from{\mathcal {K}}is induced by a combinatorial isomorphism. A finite groupGis said to beseparablewith respe...
A method of hypothetical test based on semiparametic model is put forward to analyze theseparabilityof systematic error and gross error in theory. 基于半参数模型,利用假设检验分析方法从理论上探讨了系统误差与粗差的可区分性,并通过模拟计算验证该方法的有效性与合理性。
Extremal graph theoryBandwidthSeparabilityIn this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth, thereby showing that separability and bandwidth are not linearly equivalent. Furthermore, we also prove that graphs from this class are spanning ...