Sciweavers

1143 search results - page 128 / 229
» Mental models of recursion
Sort
View
84
Voted
CDC
2009
IEEE
113views Control Systems» more  CDC 2009»
15 years 5 months ago
Decomposition based least squares estimation algorithm for non-uniformly sampled multirate systems
— In order to reduce the computational load of the recursive least squares (RLS) algorithm, a decomposition based least squares algorithm is developed for non-uniformly sampled m...
Yanjun Liu, Feng Ding
86
Voted
AML
2008
66views more  AML 2008»
15 years 25 days ago
Register computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
Peter Koepke, Ryan Siders
113
Voted
CORR
2002
Springer
99views Education» more  CORR 2002»
15 years 14 days ago
Intersection Types and Lambda Theories
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of -theories. Relying on the notion of easy intersection type theory we succes...
Mariangiola Dezani-Ciancaglini, Stefania Lusin
TIT
2002
62views more  TIT 2002»
15 years 10 days ago
Maximum-likelihood binary shift-register synthesis from noisy observations
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...
Todd K. Moon
JCT
2010
92views more  JCT 2010»
14 years 11 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
Gábor Hetyei