Results 261 to 270 of about 190,413 (302)
Some of the next articles are maybe not open access.
TIGHTENING: MORPHOLOGICAL SIMPLIFICATION
International Journal of Computational Geometry & Applications, 2007Given a two- or three-dimensional set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has mean curvature with magnitude less than or equal to 1/r and which only differs from S in a morphologically-defined tolerance zone we call the mortar.
Jason Williams 0007, Jarek Rossignac
openaire +3 more sources
SIAM Review, 1972
An attempt is made to clarify two frequently used applied mathematical techniques. Section 1 begins with a description of the basic simplification procedure in which a term is neglected under the assumption that it is small, and the consistency of this assumption is later checked.
openaire +2 more sources
An attempt is made to clarify two frequently used applied mathematical techniques. Section 1 begins with a description of the basic simplification procedure in which a term is neglected under the assumption that it is small, and the consistency of this assumption is later checked.
openaire +2 more sources
The Simplification of Science and the Science of Simplification
1991In order to understand the successes of science, we can do no better than to examine physics—and particularly mechanics—for these sciences are often taken to be ideal models. The beauty of the mechanical model of the world was well expressed by Deutsch,1 who said that mechanism ...
openaire +1 more source
Recursion Structure Simplification
SIAM Journal on Computing, 1975This paper discusses a family of algorithms for transforming a recursive program into an equivalent program with a simplified recursion structure. The simplification is performed by integrating copies of certain procedures into the bodies of other procedures.
Strong, H. R. jun. +2 more
openaire +1 more source
The Text Simplification in TERENCE
2014In this paper we present the TERENCE system of text simplification. The TERENCE simplification system is intended for use by researchers, educators and policy makers. The method is innovative in the field for two reasons. Firstly, differently from other methods of automatic or manual simplification, it offers a graded, cumulative, simplification of ...
ARFE', BARBARA, J. Oakhill, E. Pianta
openaire +3 more sources
Simplification of Sequences of Operators
IEEE Transactions on Systems, Man, and Cybernetics, 1972The output of a system is often expressed as a sequence of unary and/or binary operations on the input. Analysis or design considerations may require manipulation of the sequence of operators to obtain an equivalent sequence either mathematically simpler or easier to design.
Robert J. Polge, Louis Callas
openaire +2 more sources
Lazy unification with simplification
1994Unification in the presence of an equational theory is an important problem in theorem-proving and in the integration of functional and logic programming languages. This paper presents an improvement of the proposed lazy unification methods by incorporating simplification into the unification process. Since simplification is a deterministic computation
openaire +3 more sources
Simplification of nested radicals
30th Annual Symposium on Foundations of Computer Science, 1989Let \(k\) be a field of characteristic zero, and let \(\alpha\) be a nested radical over \(k\). Let \(L\) be the splitting field of the minimal polynomial of \(\alpha\) over \(k\), and let \(G=\text{Gal}(L/k)\). If \(K\) contains all roots of unity then \(\alpha\) can be denested only within \(L\).
openaire +2 more sources