Sciweavers

1337 search results - page 68 / 268
» Fast computation of distance estimators
Sort
View
ICS
2000
Tsinghua U.
15 years 10 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy
FSR
2007
Springer
108views Robotics» more  FSR 2007»
16 years 14 days ago
Robust Real-Time Local Laser Scanner Registration with Uncertainty Estimation
We present a fast, robust method for registering successive laser rangefinder scans. Correspondences between the current scan and previous scans are determined. Gaussian uncertai...
Justin Carlson, Charles E. Thorpe, David L. Duke
ICRA
2003
IEEE
126views Robotics» more  ICRA 2003»
15 years 11 months ago
Real-time tracking and pose estimation for industrial objects using geometric features
— This paper presents a fast tracking algorithm capable of estimating the complete pose (6DOF) of an industrial object by using its circular-shape features. Since the algorithm i...
Youngrock Yoon, Guilherme N. DeSouza, Avinash C. K...
IJON
1998
44views more  IJON 1998»
15 years 6 months ago
Hierarchical RBF networks and local parameters estimate
The method presented here is aimed to a direct fast setting of the parameters of a RBF network for function approximation. It is based on a hierarchical gridding of the input spac...
N. Alberto Borghese, Stefano Ferrari
ICIP
2010
IEEE
15 years 4 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen