Sciweavers

2479 search results - page 26 / 496
» A Computational Theory of Working Memory
Sort
View
DIAGRAMS
2010
Springer
13 years 8 months ago
An Attention Based Theory to Explore Affordances of Textual and Diagrammatic Proofs
Shimojima and Katagiri have demonstrated that diagrams reduce "inferential load" during reasoning by scaffolding visual-spatial aspects of memory. In response, we wondere...
Peter Coppin, Jim Burton, Stephen Hockema
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 11 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
IWMM
2007
Springer
118views Hardware» more  IWMM 2007»
14 years 1 months ago
Detecting and eliminating memory leaks using cyclic memory allocation
We present and evaluate a new technique for detecting and eliminating memory leaks in programs with dynamic memory allocation. This technique observes the execution of the program...
Huu Hai Nguyen, Martin C. Rinard
PLDI
1994
ACM
13 years 11 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar
ISCA
1997
IEEE
137views Hardware» more  ISCA 1997»
13 years 11 months ago
VM-Based Shared Memory on Low-Latency, Remote-Memory-Access Networks
Recent technological advances have produced network interfaces that provide users with very low-latency access to the memory of remote machines. We examine the impact of such netw...
Leonidas I. Kontothanassis, Galen C. Hunt, Robert ...