Sciweavers

5158 search results - page 196 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
SAC
2006
ACM
16 years 14 days ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
ICRA
2005
IEEE
174views Robotics» more  ICRA 2005»
16 years 3 days ago
Kinematics and Dexterity Analysis for a Novel 3-DOF Translational Parallel Manipulator
— A new three degrees of freedom translational parallel manipulator (TPM) with fixed actuators, called a general 3-PRC TPM, is proposed in this paper. The mobility of the manipu...
Yangmin Li, Qingsong Xu
FROCOS
2005
Springer
16 years 1 days ago
A Comprehensive Framework for Combined Decision Procedures
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
COLT
1998
Springer
15 years 10 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund
COMPGEOM
2007
ACM
15 years 10 months ago
Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
Balint Miklos, Joachim Giesen, Mark Pauly