Sciweavers

6365 search results - page 230 / 1273
» Fast Local Computation Algorithms
Sort
View
FOCS
2000
IEEE
15 years 10 months ago
Topological Persistence and Simplification
We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens ...
Herbert Edelsbrunner, David Letscher, Afra Zomorod...
168
Voted
ICPR
2008
IEEE
16 years 27 days ago
Constrained piecewise linear approximation of digital curves
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
Alexander Kolesnikov
CORR
2010
Springer
208views Education» more  CORR 2010»
15 years 6 months ago
MapReduce for Integer Factorization
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
Javier Tordable
IROS
2009
IEEE
212views Robotics» more  IROS 2009»
16 years 1 months ago
3D feature based mapping towards mobile robots' enhanced performance in rescue missions
— This paper presents a feature based 3D mapping approach with regard to obtaining compact models of semistructured environments such as partially destroyed buildings where mobil...
Paloma de la Puente, Diego Rodríguez-Losada...
174
Voted
IS4TH
2003
Springer
15 years 11 months ago
Integrating Geometric and Biomechanical Models of a Liver Tumour for Cryosurgery Simulation
Abstract. In this paper, we present a 3D reconstruction approach of a liver tumour model from a sequence of 2D MR parallel cross-sections, and the integration of this reconstructed...
Alexandra Branzan Albu, Jean-Marc Schwartz, Denis ...