Sciweavers

2035 search results - page 137 / 407
» Working memory
Sort
View
FMCO
2008
Springer
109views Formal Methods» more  FMCO 2008»
15 years 5 months ago
Session-Based Compilation Framework for Multicore Programming
This paper outlines a general picture of our ongoing work under EU Mobius and Sensoria projects on a type-based compilation and execution framework for a class of multicore CPUs. O...
Nobuko Yoshida, Vasco Thudichum Vasconcelos, Herv&...
APCCM
2009
15 years 4 months ago
Modeling Natural Language Communication in Database Semantics
Database Semantics (DBS) is a computational model of how communicating with natural language works. at a level of abstraction which may be applied to natural and artificial agents...
Roland Hausser
CGF
2010
98views more  CGF 2010»
15 years 3 months ago
Fast Generation of Pointerless Octree Duals
Geometry processing applications frequently rely on octree structures, since they provide simple and efficient hierarchies for discrete data. However, octrees do not guarantee dire...
Thomas Lewiner, Vinícius Mello, Adelailson ...
TPDS
2002
94views more  TPDS 2002»
15 years 3 months ago
Recursive Array Layouts and Fast Matrix Multiplication
The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache conflicts cause traditi...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
146
Voted
PPOPP
1999
ACM
15 years 7 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard