Sciweavers

10805 search results - page 91 / 2161
» Mapping Computation with No Memory
Sort
View
ICCV
2003
IEEE
15 years 11 months ago
Computing MAP trajectories by representing, propagating and combining PDFs over groups
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
Paul Smith, Tom Drummond, Kimon Roussopoulos
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
15 years 10 months ago
Classifier systems that compute action mappings
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
Pier Luca Lanzi, Daniele Loiacono
ICPP
2007
IEEE
16 years 20 days ago
Integrating Memory Compression and Decompression with Coherence Protocols in Distributed Shared Memory Multiprocessors
Ever-increasing memory footprint of applications and increasing mainstream popularity of shared memory parallel computing motivate us to explore memory compression potential in di...
Lakshmana Rao Vittanala, Mainak Chaudhuri
CASES
2006
ACM
16 years 10 days ago
Scalable subgraph mapping for acyclic computation accelerators
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
Nathan Clark, Amir Hormati, Scott A. Mahlke, Sami ...
HIPC
2003
Springer
15 years 11 months ago
Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks
This paper shows that an n = 2k processor Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can simulate either a mono-directional move of a...
Alessandro Mei, Romeo Rizzi