Sciweavers

410 search results - page 64 / 82
» A Fast Method for Local Penetration Depth Computation
Sort
View
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
15 years 1 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof
ICRA
2000
IEEE
111views Robotics» more  ICRA 2000»
15 years 4 months ago
Learning Globally Consistent Maps by Relaxation
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
VISSYM
2003
15 years 1 months ago
Adaptive Smooth Scattered Data Approximation for Large-scale Terrain Visualization
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
Martin Bertram, Xavier Tricoche, Hans Hagen
EMNLP
2010
14 years 9 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura
BMCBI
2007
128views more  BMCBI 2007»
14 years 11 months ago
A robust and efficient algorithm for the shape description of protein structures and its application in predicting ligand bindin
Background: An accurate description of protein shape derived from protein structure is necessary to establish an understanding of protein-ligand interactions, which in turn will l...
Lei Xie, Philip E. Bourne