2479 search results - page 150 / 496 » A Computational Theory of Working Memory |
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
CHI
2010
ACM
14 years 2 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
MM
2006
ACM
14 years 1 months ago
2006
ACM
The paper discusses the digital artwork series Impossible Geographies, works that weave dynamic cartographies of invisible, fragile and hybrid spaces. Impossible Geographies 01: M...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
APLAS
2010
ACM
13 years 6 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...