Geometric thickness of complete graphs.
Geometrical characterization of observability in Interpreted Petri Nets
This work is concerned with observability in Discrete Event Systems (DES) modeled by Interpreted Petri Nets (IPN). Three major contributions are presented. First, a novel geometric characterization of observability based on input-output equivalence relations on the marking sequences sets is presented. Later, to show that this characterization is well posed, it is applied to linear continuous systems, leading to classical characterizations of observability for continuous systems. Finally, this paper...
Geometrické modelování – od historie k současnosti a budoucnosti
Géométrie des polynômes. Coût global moyen de la méthode de Newton
Geometry processing : intersections, contours, and cubatures
Global optimization by artificial life : a new technique using genetic population evolution
Global output-feedback finite-time stabilization for a class of stochastic nonlinear cascaded systems
In this paper, the problem of global finite-time stabilization via output-feedback is investigated for a class of stochastic nonlinear cascaded systems (SNCSs). First, based on the adding a power integrator technique and the homogeneous domination approach, a global output-feedback finite-time control law is constructed for the driving subsystem. Then, based on homogeneous systems theory, it is shown that under some mild conditions the global finite- time stability in probability of the driving...
Globular realization and cubical underlying homotopy type of time flow of process algebra.
Glueing enriched modules and composition of automata
Goffin's algorithm for zonotopes
The Löwner-John ellipse of a full-dimensional bounded convex set is a circumscribed ellipse with the property that if we shrink it by the factor (where is dimension), we obtain an inscribed ellipse. Goffin’s algorithm constructs, in polynomial time, a tight approximation of the Löwner-John ellipse of a polyhedron given by facet description. In this text we adapt the algorithm for zonotopes given by generator descriptions. We show that the adapted version works in time polynomial in the size...
Good functors... are those preserving philosophy !
Gorenstein polytopes obtained from bipartite graphs.
Gradient flow optimization for reducing blocking effects of transform coding
This paper addresses the problem of reducing blocking effects in transform coding. A novel optimization approach using the gradient flow is proposed. Using some properties of the gradient flow on a manifold, an optimized filter design method for reducing the blocking effects is presented. Based on this method, an image reconstruction algorithm is derived. The algorithm maintains the fidelity of images while reducing the blocking effects. Experimental tests demonstrate that the presented algorithm...
Gramáticas discriminantes y funciones discriminantes lineales generalizadas.
Las Gramáticas Discriminantes constituyen una aproximación para la clasificación de frases generadas por Gramáticas cuando la presencia de ruidos y distorsiones hace difícil la aplicación de las Técnicas usuales de Análisis Sintáctico. Sin embargo, la formulación original (Filipski 80) presenta una restricción pues las gramáticas características deben ser las mismas para todas las clases. En este trabajo se presenta una solución al problema, mediante la aplicación de una Extensión de las Funciones...
Grammaires algébriques et monoïdes simplifiables
Grammaires parenthésées et bilangages réguliers
Grammatical levels and subgrammars of context-free grammars
Graph colorings with local constraints - a survey
We survey the literature on those variants of the chromatic number problem where not only a proper coloring has to be found (i.e., adjacent vertices must not receive the same color) but some further local restrictions are imposed on the color assignment. Mostly, the list colorings and the precoloring extensions are considered. In one of the most general formulations, a graph G = (V,E), sets L(v) of admissible colors, and natural numbers for the vertices v ∈ V are given, and the question is whether...
Graph decompositions and factorizing permutations.
Graph drawing by high-dimensional embedding.