13041 search results - page 255 / 2609 » Simulating space and time |
161
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
It is known that many subspace algorithms give biased estimates for closed-loop data due to the existence of feedback. In this paper we present a new subspace identification metho...
195
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
195
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be p...
178
click to vote
ACL
1994
15 years 8 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
140
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— An intercarrier interference (ICI) canceling technique for multiple-input single-output (MISO) orthogonal frequency division multiplexing (OFDM) systems in fast fading channels...