All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 922

Showing per page

A coalgebraic view on reachability

Thorsten Wißmann, Stefan Milius, Shin-ya Katsumata, Jérémy Dubut (2019)

Commentationes Mathematicae Universitatis Carolinae

Coalgebras for an endofunctor provide a category theoretic framework for modeling a wide range of state-based systems of various types. We provide an iterative construction of the reachable part of a given pointed coalgebra that is inspired by and resembles the standard breadth-first search procedure to compute the reachable part of a graph. We also study coalgebras in Kleisli categories: for a functor extending a functor on the base category, we show that the reachable part of a given pointed coalgebra...

A compactness result for a second-order variational discrete model

Andrea Braides, Anneliese Defranceschi, Enrico Vitali (2012)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

We analyze a nonlinear discrete scheme depending on second-order finite differences. This is the two-dimensional analog of a scheme which in one dimension approximates a free-discontinuity energy proposed by Blake and Zisserman as a higher-order correction of the Mumford and Shah functional. In two dimension we give a compactness result showing that the continuous problem approximating this difference scheme is still defined on special functions with bounded hessian, and we give an upper and a lower...

A compactness result for a second-order variational discrete model

Andrea Braides, Anneliese Defranceschi, Enrico Vitali (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

We analyze a nonlinear discrete scheme depending on second-order finite differences. This is the two-dimensional analog of a scheme which in one dimension approximates a free-discontinuity energy proposed by Blake and Zisserman as a higher-order correction of the Mumford and Shah functional. In two dimension we give a compactness result showing that the continuous problem approximating this difference scheme is still defined on special functions...

A comparative evaluation of medium- and large-scale feature selectors for pattern classifiers

Mineichi Kudo, Jack Sklansky (1998)

Kybernetika

Needs of feature selection in medium and large problems increases in many fields including medical and image processing fields. Previous comparative studies of feature selection algorithms are not satisfactory in problem size and in criterion function. In addition, no way has not shown to compare algorithms with different objectives. In this study, we propose a unified way to compare a large variety of algorithms. Our results show that the sequential floating algorithms promises for up to medium...

A comparative study of microaggregation methods.

Josep Maria Mateo Sanz, Josep Domingo Ferrer (1998)

Qüestiió

Microaggregation is a statistical disclosure control technique for microdata. Raw microdata (i.e. individual records) are grouped into small aggregates prior to publication. Each aggregate should contain at least k records to prevent disclosure of individual information. Fixed-size microaggregation consists of taking fixed-size microaggregates (size k). Data-oriented microaggregation (with variable group size) was introduced recently. Regardless of the group size, microaggregations on a multidimensional...

A comparison of evidential networks and compositional models

Jiřina Vejnarová (2014)

Kybernetika

Several counterparts of Bayesian networks based on different paradigms have been proposed in evidence theory. Nevertheless, none of them is completely satisfactory. In this paper we will present a new one, based on a recently introduced concept of conditional independence. We define a conditioning rule for variables, and the relationship between conditional independence and irrelevance is studied with the aim of constructing a Bayesian-network-like model. Then, through a simple example, we will...

A comparison of Jacobian-based methods of inverse kinematics for serial robot manipulators

Ignacy Dulęba, Michał Opałka (2013)

International Journal of Applied Mathematics and Computer Science

The objective of this paper is to present and make a comparative study of several inverse kinematics methods for serial manipulators, based on the Jacobian matrix. Besides the well-known Jacobian transpose and Jacobian pseudo-inverse methods, three others, borrowed from numerical analysis, are presented. Among them, two approximation methods avoid the explicit manipulability matrix inversion, while the third one is a slightly modified version of the Levenberg-Marquardt method (mLM). Their comparison...

A complete characterization of primitive recursive intensional behaviours

P. Valarcher (2008)

RAIRO - Theoretical Informatics and Applications

We give a complete characterization of the class of functions that are the intensional behaviours of primitive recursive (PR) algorithms. This class is the set of primitive recursive functions that have a null basic case of recursion. This result is obtained using the property of ultimate unarity and a geometrical approach of sequential functions on N the set of positive integers.

Currently displaying 41 – 60 of 922