3670 search results - page 98 / 734 » Linear Recursive Functions |
147
click to vote
TIT
2002
15 years 5 months ago
2002
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...
181
click to vote
ESANN
2004
15 years 7 months ago
2004
The one-dimensional functional equation g(y(t)) = cg(z(t)) with known functions y and z and constant c is considered. The indeterminacies are calculated, and an algorithm for appro...
146
click to vote
STOC
1990
ACM
15 years 10 months ago
1990
ACM
We prove that monotone circuits computing the perfect matching function on n-vertex graphs require (n) depth. This implies an exponential gap between the depth of monotone and non...
131
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...
153
click to vote
COCO
2001
Springer
15 years 10 months ago
2001
Springer
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...