Sciweavers

2200 search results - page 37 / 440
» The Generalized Pignistic Transformation
Sort
View
COLT
1992
Springer
15 years 8 months ago
Polynomial Time Inference of a Subclass of Context-Free Transformations
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
JMIV
2006
128views more  JMIV 2006»
15 years 3 months ago
General Adaptive Neighborhood Image Processing:
The so-called General Adaptive Neighborhood Image Processing (GANIP) approach is presented in a two parts paper dealing respectively with its theoretical and practical aspects. The...
Johan Debayle, Jean-Charles Pinoli
156
Voted
ECCV
2006
Springer
16 years 5 months ago
A General Framework for Motion Segmentation: Independent, Articulated, Rigid, Non-rigid, Degenerate and Non-degenerate
Abstract. We cast the problem of motion segmentation of feature trajectories as linear manifold finding problems and propose a general framework for motion segmentation under affin...
Jingyu Yan, Marc Pollefeys
143
Voted
IROS
2008
IEEE
104views Robotics» more  IROS 2008»
15 years 10 months ago
Generalizing metamodules to simplify planning in modular robotic systems
— In this paper we develop a theory of metamodules and an associated distributed asynchronous planner which generalizes previous work on metamodules for lattice-based modular rob...
Daniel J. Dewey, Michael P. Ashley-Rollman, Michae...
VTC
2008
IEEE
125views Communications» more  VTC 2008»
15 years 10 months ago
A General Formula for Log-MGF Computation: Application to the Approximation of Log-Normal Power Sum via Pearson Type IV Distribu
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci