47 search results - page 9 / 10 » Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Co... |
DAM
2011
13 years 2 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
VR
2003
IEEE
14 years 18 days ago
2003
IEEE
We present an experiment comparing double exponential smoothing and Kalman filter-based predictive tracking algorithms with derivative free measurement models. Our results show t...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We consider the sparse grid combination technique for regression, which we regard as a problem of function reconstruction in some given function space. We use a regularised least ...
DCC
2003
IEEE
14 years 7 months ago
2003
IEEE
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
DCG
1998
13 years 7 months ago
1998
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...