2479 search results - page 241 / 496 » A Computational Theory of Working Memory |
168
click to vote
CHI
2003
ACM
16 years 7 months ago
2003
ACM
This paper considers how we may realize future ubiquitous domestic environments. Building upon previous work on how buildings evolve by Stewart Brand, we suggest the need to broad...
186
click to vote
SCALESPACE
2009
Springer
16 years 1 months ago
2009
Springer
We study the mathematical and numerical aspects of the estimation of the 3-D shape of a Lambertian scene seen under diffuse illumination. This problem is known as “shape from amb...
140
click to vote
ACMSE
2006
ACM
16 years 20 days ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
141
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
We propose three distance measures for genetic search space. One is a distance measure in the population space that is useful for understanding the working mechanism of genetic al...
181
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...