Sciweavers

1679 search results - page 92 / 336
» Strong order equivalence
Sort
View
SIAMCO
2010
115views more  SIAMCO 2010»
13 years 4 months ago
Identification of Hammerstein Systems with Quantized Observations
This work is concerned with identification of Hammerstein systems whose outputs are measured by quantized sensors. The system consists of a memoryless nonlinearity that is polynomi...
Yanlong Zhao, Ji-Feng Zhang, Le Yi Wang, Gang Geor...
ICDE
2010
IEEE
192views Database» more  ICDE 2010»
14 years 4 months ago
XML reasoning made practical
— We present a tool for the static analysis of XPath queries and XML Schemas. The tool introduces techniques used in the field of verification (such as binary decision diagrams...
Pierre Genevès, Nabil Layaïda
ISSAC
1990
Springer
65views Mathematics» more  ISSAC 1990»
14 years 2 months ago
Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations
Let a system of linear ordinary differential equations of the first order Y' = AY be given, where A is n x n matrix over a field F(X), assume that the degree degx(A) < d a...
Dima Grigoriev
FOSSACS
2004
Springer
14 years 1 months ago
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...
Pietro Di Gianantonio, Marino Miculan
DGCI
2009
Springer
14 years 1 months ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
Xavier Provençal, Jacques-Olivier Lachaud