Sciweavers

11565 search results - page 236 / 2313
» Computing Minimal Mappings
Sort
View
EGC
2005
Springer
15 years 10 months ago
Learning Automata Based Algorithms for Mapping of a Class of Independent Tasks over Highly Heterogeneous Grids
Computational grid provides a platform for exploiting various computational resources over wide area networks. One of the concerns in implementing computational grid environment is...
S. Ghanbari, Mohammad Reza Meybodi
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
Seamless Montage for Texturing Models
We present an automatic method to recover high-resolution texture over an object by mapping detailed photographs onto its surface. Such high-resolution detail often reveals inaccu...
Ran Gal, Yonatan Wexler, Eyal Ofek, Hugues Hoppe, ...
ICRA
2009
IEEE
154views Robotics» more  ICRA 2009»
15 years 11 months ago
On the complexity and consistency of UKF-based SLAM
— This paper addresses two key limitations of the unscented Kalman filter (UKF) when applied to the simultaneous localization and mapping (SLAM) problem: the cubic, in the numbe...
Guoquan Huang, Anastasios I. Mourikis, Stergios I....
FCCM
2002
IEEE
171views VLSI» more  FCCM 2002»
15 years 10 months ago
Coarse-Grain Pipelining on Multiple FPGA Architectures
Reconfigurable systems, and in particular, FPGA-based custom computing machines, offer a unique opportunity to define application-specific architectures. These architectures offer...
Heidi E. Ziegler, Byoungro So, Mary W. Hall, Pedro...
ICCVW
1999
Springer
15 years 9 months ago
An Experimental Comparison of Stereo Algorithms
While many algorithms for computing stereo correspondence have been proposed, there has been very little work on experimentally evaluating algorithm performance, especially using r...
Richard Szeliski, Ramin Zabih