Sciweavers

6365 search results - page 848 / 1273
» Fast Local Computation Algorithms
Sort
View
COMPUTING
2007
97views more  COMPUTING 2007»
15 years 7 months ago
Multiresolution morphing for planar curves
We present a multiresolution morphing algorithm using “as-rigid-as-possible” shape interpolation combinedwithanangle-lengthbasedmultiresolutiondecompositionofsimple2Dpiecewise...
Stefanie Hahmann, Georges-Pierre Bonneau, Baptiste...
SMA
2008
ACM
173views Solid Modeling» more  SMA 2008»
15 years 7 months ago
Visibility-based feature extraction from discrete models
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...
Antoni Chica
AI
2000
Springer
15 years 7 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
QSHINE
2009
IEEE
16 years 2 months ago
Cooperative Training in Wireless Sensor and Actor Networks
Exploiting features of high density wireless sensor networks represents a challenging issue. In this work, the training of a sensor network which consists of anonymous and asynchro...
Francesco Betti Sorbelli, Roberto Ciotti, Alfredo ...
PAMI
1998
197views more  PAMI 1998»
15 years 7 months ago
Inference of Integrated Surface, Curve, and Junction Descriptions From Sparse 3D Data
—We are interested in descriptions of 3D data sets, as obtained from stereo or a 3D digitizer. We therefore consider as input a sparse set of points, possibly associated with cer...
Chi-Keung Tang, Gérard G. Medioni