Sciweavers

60 search results - page 10 / 12
» Optimal local map size for EKF-based SLAM
Sort
View
HCW
2000
IEEE
13 years 11 months ago
A Heuristic Algorithm for Mapping Communicating Tasks on Heterogeneous Resources
A heuristic algorithm that maps data-processing tasks onto heterogeneous resources (i.e., processors and links of various capacities) is presented. The algorithm tries to achieve ...
Kenjiro Taura, Andrew A. Chien
IPPS
2006
IEEE
14 years 1 months ago
Exploring the design space of an optimized compiler approach for mesh-like coarse-grained reconfigurable architectures
In this paper we study the performance improvements and trade-offs derived from an optimized mapping approach applied on a parametric coarse grained reconfigurable array architect...
Grigoris Dimitroulakos, Michalis D. Galanis, Const...
CVPR
2005
IEEE
14 years 9 months ago
Locally Adaptive Support-Weight Approach for Visual Correspondence Search
In this paper, we present a new area-based method for visual correspondence search that focuses on the dissimilarity computation. Local and area-based matching methods generally m...
Kuk-Jin Yoon, In-So Kweon
LCPC
2000
Springer
13 years 11 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
IPPS
1998
IEEE
13 years 11 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser