Sciweavers

364 search results - page 23 / 73
» Generalized normal forms and polynomial system solving
Sort
View
HYBRID
2009
Springer
15 years 4 months ago
Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
Radu Grosu
83
Voted
TSP
2010
14 years 4 months ago
ARMA signals with specified symmetric marginal probability distribution
Except in the case of normal (i.e Gaussian) distribution, it is very difficult to calculate the marginal probability distribution of ARMA signals. By using a particular form of mo...
Bernard C. Picinbono
ESOP
1994
Springer
15 years 1 months ago
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
Torben Amtoft
75
Voted
JCT
2007
90views more  JCT 2007»
14 years 9 months ago
Enumeration problems for classes of self-similar graphs
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
Elmar Teufl, Stephan Wagner
86
Voted
ECCV
2006
Springer
15 years 11 months ago
Self-calibration of a General Radially Symmetric Distortion Model
Abstract. We present a new approach for self-calibrating the distortion function and the distortion center of cameras with general radially symmetric distortion. In contrast to mos...
Jean-Philippe Tardif, Peter F. Sturm, Sébas...