Direct neighborhood discriminant analysis for face recognition.
Directable automata and directly subdefinite events
Directable automata and their generalizations: A survey.
Directed forests with application to algorithms related to Markov chains
This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.
Directive words of episturmian words : equivalences and normalization
Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. Thus, an episturmian word can be defined by one of its morphic decompositions or, equivalently, by a certain directive word. Here we characterize pairs of words directing the same episturmian word. We also propose a way to uniquely define any episturmian word through a normalization of its directive words. As a consequence...
Directive words of episturmian words: equivalences and normalization
Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. Thus, an episturmian word can be defined by one of its morphic decompositions or, equivalently, by a certain directive word. Here we characterize pairs of words directing the same episturmian word. We also propose a way to uniquely define any episturmian word through a normalization of its directive words. As a consequence...
Discovery of functional and approximate functional dependencies in relational databases.
Discrete approximation of the Mumford-Shah functional in dimension two
Discrete approximation of the Mumford-Shah functional in dimension two
The Mumford-Shah functional, introduced to study image segmentation problems, is approximated in the sense of vergence by a sequence of integral functionals defined on piecewise affine functions.
Discrete planes, -actions, Jacobi-Perron algorithm and substitutions
We introduce two-dimensional substitutions generating two-dimensional sequences related to discrete approximations of irrational planes. These two-dimensional substitutions are produced by the classical Jacobi-Perron continued fraction algorithm, by the way of induction of a -action by rotations on the circle. This gives a new geometric interpretation of the Jacobi-Perron algorithm, as a map operating on the parameter space of -actions by rotations.
Discrete-time symmetric polynomial equations with complex coefficients
Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.
Discriminating between causal structures in Bayesian Networks given partial observations
Given a fixed dependency graph that describes a Bayesian network of binary variables , our main result is a tight bound on the mutual information of an observed subset of the variables . Our bound depends on certain quantities that can be computed from the connective structure of the nodes in . Thus it allows to discriminate between different dependency graphs for a probability distribution, as we show from numerical experiments.
Discussing graph theory with a computer. II: Theorems suggested by the computer.
Discussing Graph Theory with a Computer III, Man-machine Theorem Proving
Diseño Geométrico Asistido por Ordenador: Álgebra, Geometría y Computación.
Disjoint unions of complete graphs characterized by their Laplacian spectrum.
Disjunction in modal description logics.
Disjunctive languages and compatible orders
Disjunktive Teilmengen inverser Halbgruppen
Dislocation dynamics - analytical description of the interaction force between dipolar loops
The interaction between dislocation dipolar loops plays an important role in the computation of the dislocation dynamics. The analytical form of the interaction force between two loops derived in the present paper from Kroupa’s formula of the stress field generated by a single dipolar loop allows for faster computation.