107 search results - page 18 / 22 » Polynomially Bounded Matrix Interpretations |
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
AUTOMATICA
2007
13 years 6 months ago
2007
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
MA
2010
Springer
13 years 5 months ago
2010
Springer
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
APPROX
2009
Springer
14 years 1 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...