Results 271 to 280 of about 99,581 (308)
Some of the next articles are maybe not open access.
Mémoire professionnel, Bachelor of arts en enseignement pour les degrés préscolaire et ...
Robellaz, Manon, Siegenthaler, Norah
openaire +1 more source
Robellaz, Manon, Siegenthaler, Norah
openaire +1 more source
Evaluation of AutoLISP Expressions
1996Problem solving involves modeling the real world inside the computer. We perform this familiar process all the time in our drawings, knowing full well that we’re looking at, say, a wireframe, rather than a real object.
openaire +1 more source
Evaluation of facial expression recognition
3rd European Conference on Visual Media Production (CVMP 2006). Part of the 2nd Multimedia Conference 2006, 2006This article documents an investigation into the use of neural networks for facial expression recognition from still images. Facial images were pre-processed with the principle components analysis (PCA) algorithm then classified with the use of back-propagation neural networks.
T.I. Botley, D. Makris
openaire +1 more source
Optimal contiguous expression DAG evaluations
1995Generating evaluations for expression DAGs with a minimal number of registers is NP-complete. We present two algorithms that generate optimal contiguous evaluation for a given DAG. The first is a modification of a complete search algorithm that omits redundant evaluations.
Christoph W. Keßler, Thomas Rauber
openaire +1 more source
Evaluation of General Set Expressions
2008We consider the problem of evaluating an expression over sets. The sets are preprocessed and are therefore sorted, and the operators can be any of union, intersection, difference, complement, and symmetric difference (exclusive union). Given the expression as a formula and the sizes of the input sets, we are interested in the worst-case complexity of ...
Ehsan Chiniforooshan +2 more
openaire +1 more source
Alternative Evaluation of Array Expressions
1991Traditionally, languages that support array-style programming have evaluated array expressions by computing all the elements of an array before making it available for subsequent computation. This method is simple, easily implemented, but generally inefficient. Narrowly viewed as an optimization problem, recent work has focused on using lazy evaluation
openaire +1 more source
Explicit evaluations of Turán expressions
Annali di Matematica Pura ed Applicata, 1955Positive representations for [Pn(λ)(x)]2−Pn−1/(λ)(x)Pn+1/(λ)(x) and for analogous expressions involving orthogonal polynomials are obtained.
openaire +1 more source
Optimal evaluation of algebraic expressions
1986Algebraic computation systems produce results for either human or machine consumption. In the latter case, numerical evaluation of the resulting expressions is often the goal. In either case, it is important to produce results in an appropriately optimal form. In this paper, we consider some of the methods available for doing this.
openaire +1 more source
Instruction Sets for Evaluating Arithmetic Expressions
Journal of the ACM, 1983Coffman, E. G. jun., Sethi, Ravi
openaire +2 more sources

