Results 221 to 230 of about 108,606 (260)
Some of the next articles are maybe not open access.
Fundamenta Informaticae, 1982
It is known that it is possible to impose a metric on the free iteration theory Γtr of Γ-trees such that the iterate f† of any tree f : n → p + n is a limit of of ‘finite approximations’ of f. Since this notion of limiting computation corresponds to our intuitive notion of iteration, it is natural to ask which other theories in the variety generated by
openaire +2 more sources
It is known that it is possible to impose a metric on the free iteration theory Γtr of Γ-trees such that the iterate f† of any tree f : n → p + n is a limit of of ‘finite approximations’ of f. Since this notion of limiting computation corresponds to our intuitive notion of iteration, it is natural to ask which other theories in the variety generated by
openaire +2 more sources
PROBABILITY AND METRIC DISCREPANCY THEORY
Stochastics and Dynamics, 2011We give an overview of probabilistic phenomena in metric discrepancy theory and present several new results concerning the asymptotic behavior of discrepancies DN(nkx) and sums ∑ckf(nkx) for sequences (nk)k ≥ 1 of integers.
Aistleitner, Christoph, Berkes, István
openaire +2 more sources
Mathematical Structures in Computer Science, 2014
This paper is a further investigation of a project carried out in Didehvar and Ghasemloo (2009) to study effective aspects of the metric logic. We prove an effective version of the omitting types theorem. We also present some concrete computable constructions showing that both the separable atomless probability algebra and the rational Urysohn space ...
Massoud Pourmahdian +2 more
openaire +2 more sources
This paper is a further investigation of a project carried out in Didehvar and Ghasemloo (2009) to study effective aspects of the metric logic. We prove an effective version of the omitting types theorem. We also present some concrete computable constructions showing that both the separable atomless probability algebra and the rational Urysohn space ...
Massoud Pourmahdian +2 more
openaire +2 more sources
Complexity Reduction: theory, metrics and applications
2007 IEEE International Conference on Research, Innovation and Vision for the Future, 2007Generalized Galois lattices formalism for computing contextual categorization allows metrics to evaluate complexity and efficiency as well as methods for simplifying or complicating the external object at hand. Such methods are adapted for virtual environments and augmented reality devices for which it is simple to change the distribution of features ...
Tijus, Charles +5 more
openaire +2 more sources
Compatible Orderings on the Metric Theory of Trees
SIAM Journal on Computing, 1980In many studies of computation which make use of rooted labeled trees a partial ordering is usually imposed on the trees in the following way. A particular label, say $ \bot _0 $, is distinguished and identified with the atomic tree whose only vertex is a leaf labeled $ \bot _0 $.
Stephen L. Bloom, Ralph Tindell
openaire +2 more sources
Choquet Theory in Metric Spaces
Zeitschrift für Analysis und ihre Anwendungen, 2000This paper deals with a generalization of the classical Choquet theorem. We consider metric spaces which are endowed with an abstract notion of convexity. Convex combinations are obtained by the solutions of variational inequalities. A generalized Krein-Milman theorem is derived from our Choquet theorem.
openaire +2 more sources
A unified theory of software metrics
Proceedings of the 1988 ACM sixteenth annual conference on Computer science - CSC '88, 1988The science of software metrics is a broad one touching on software engineering, structured programming and the mathematical discipline of measure theory. The third emphasizes what space is measurable or not; the second, what characteristics are to be measured; and the first, the potential feedback effects of measurement.
openaire +1 more source
The Poincaré Metric and the Bergman Theory
SIAM ReviewzbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Towards Metric Theory of Metric Regularity
2001It is shown that exact estimates for local metric regularity are obtained with the help of the slope introduced by De Giorgi-Marino-Tosques in 1980. Interrelation between the slope and subdifferentials are further analyzed.
openaire +1 more source
Implicit Functions: a Metric Theory
Set-Valued and Variational Analysis, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources