Sciweavers

10805 search results - page 22 / 2161
» Mapping Computation with No Memory
Sort
View
ICPP
2009
IEEE
13 years 6 months ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun
FPL
2001
Springer
123views Hardware» more  FPL 2001»
14 years 1 months ago
Compilation Increasing the Scheduling Scope for Multi-memory-FPGA-Based Custom Computing Machines
This paper presents new achievements on the automatic mapping of algorithms, written in imperative software programming languages, to custom computing machines. The reconfigurable ...
João M. P. Cardoso, Horácio C. Neto
RAS
2007
102views more  RAS 2007»
13 years 8 months ago
Fast and accurate SLAM with Rao-Blackwellized particle filters
Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter in which each ...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
FCCM
2000
IEEE
144views VLSI» more  FCCM 2000»
14 years 1 months ago
Automatic Synthesis of Data Storage and Control Structures for FPGA-Based Computing Engines
Mapping computations written in high-level programming languages to FPGA-based computing engines requires programmers to generate the datapath responsible for the core of the comp...
Pedro C. Diniz, Joonseok Park
IPSN
2007
Springer
14 years 2 months ago
Harbor: software-based memory protection for sensor nodes
Many sensor nodes contain resource constrained microcontrollers where user level applications, operating system components, and device drivers share a single address space with no...
Ram Kumar, Eddie Kohler, Mani B. Srivastava