6 resultados para NON-UNIFORM FINITE-DIFFERENCES

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mathematics Subject Classification: 26A33, 74B20, 74D10, 74L15

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The problem of recognition on finite set of events is considered. The generalization ability of classifiers for this problem is studied within the Bayesian approach. The method for non-uniform prior distribution specification on recognition tasks is suggested. It takes into account the assumed degree of intersection between classes. The results of the analysis are applied for pruning of classification trees.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 65M06, 65M12.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

MSC 2010: 26A33

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We characterize the groups which do not have non-trivial perfect sections and such that any strictly descending chain of non-“nilpotent-by-finite” subgroups is finite.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Given an n-ary k-valued function f, gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. In the present paper we study the properties of the symmetric function with non-trivial arity gap (2 ≤ gap(f)). We prove several results concerning decomposition of the symmetric functions with non-trivial arity gap with its minors or subfunctions. We show that all non-empty sets of essential variables in symmetric functions with non-trivial arity gap are separable. ACM Computing Classification System (1998): G.2.0.