5154 search results - page 83 / 1031 » Computing and using residuals in time series models |
UC
2005
Springer
14 years 2 months ago
2005
Springer
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
DNA
2006
Springer
14 years 19 days ago
2006
Springer
We study the times to grow structures within the tile self-assembly model proposed by Winfree, and the possible shapes that can be achieved. Our earlier work was confined to the g...
KDD
2002
ACM
14 years 9 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
NLE
2007
13 years 8 months ago
2007
We address the problem of improving the efficiency of natural language text input under degraded conditions (for instance, on mobile computing devices or by disabled users), by ta...