Results 291 to 300 of about 2,095,948 (338)
Some of the next articles are maybe not open access.

Approximated approximations for SAO

Structural and Multidisciplinary Optimization, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Groenwold, A.A.   +2 more
openaire   +3 more sources

Approximate Sorting

2013
Keeping items in order is at the essence of organizing information. This paper derives an information theoretic method for approximate sorting. It is optimal in the sense that it extracts as much reliable order information as possible from possibly noisy comparison input data.
Busse Ludwig M.   +2 more
openaire   +1 more source

Approximate Homomorphisms

COMBINATORICA, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

From approximate balls to approximate ellipses

Journal of Global Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asish Mukhopadhyay   +3 more
openaire   +1 more source

Approximating a Set of Approximate Inclusion Dependencies

2006
Approximating a collection of patterns is a new and active area of research in data mining. The main motivation lies in two observations : the number of mined patterns is often too large to be useful for any end-users and user-defined input parameters of many data mining algorithms are most of the time almost arbitrary defined (e.g.
Fabien De Marchi, Jean-Marc Petit
openaire   +2 more sources

Flexible Approximators for Approximating Fixpoint Theory

2016
Approximation fixpoint theory AFT is an algebraic framework for the study of fixpoints of operators on bilattices, which has been applied to the study of the semantics for a number of nonmonotonic formalisms. A central notion of AFT is that of stable revision based on an underlying approximating operator called approximator, where the negative ...
Fangfang Liu 0008   +4 more
openaire   +1 more source

Approximate Approximations and their Applications

1999
This paper gives a survey of an approximation method which was proposed by V. Maz'ya as underlying procedure for numerical algorithms to solve initial and boundary value problems of mathematical physics. Due to a greater flexibility in the choice of approximating functions it allows efficient approximations of multi-dimensional integral operators often
openaire   +2 more sources

Home - About - Disclaimer - Privacy