Sciweavers

6365 search results - page 6 / 1273
» Fast Local Computation Algorithms
Sort
View
ICRA
2000
IEEE
109views Robotics» more  ICRA 2000»
14 years 3 months ago
Computing the Sensory Uncertainty Field of a Vision-Based Localization Sensor
—Recently it has been recognized that robust motion planners should take into account the varying performance of localization sensors across the configuration space. Although a n...
Amit Adam, Ehud Rivlin, Ilan Shimshoni
CG
2007
Springer
13 years 11 months ago
A fast all nearest neighbor algorithm for applications involving large point-clouds
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
Jagan Sankaranarayanan, Hanan Samet, Amitabh Varsh...
PG
2007
IEEE
14 years 5 months ago
Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
Shin Yoshizawa, Alexander G. Belyaev, Hideo Yokota...
SIAMSC
2011
140views more  SIAMSC 2011»
13 years 1 months ago
A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calcu
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
Lin Lin, Chao Yang, Jianfeng Lu, Lexing Ying, Wein...
CATA
2000
14 years 6 days ago
Fast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
June-Me Park, Carl G. Looney, Hui-Chuan Chen