70 search results - page 7 / 14 » An Undecidable Linear Order That Is n-Decidable for All n |
RTA
2010
Springer
13 years 11 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
DAGSTUHL
2004
13 years 9 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
JC
2006
13 years 7 months ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
AICT
2009
IEEE
14 years 21 days ago
2009
IEEE
—In this paper, nonlinear digital filters with finite precision are analyzed as recursive systematic convolutional (RSC) encoders. An infinite impulse response (IIR) digital filt...
EOR
2011
13 years 2 months ago
2011
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...