Sciweavers

1891 search results - page 235 / 379
» Constrained Subspace Modelling
Sort
View
125
Voted
RSS
2007
134views Robotics» more  RSS 2007»
15 years 4 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
SBBD
2007
179views Database» more  SBBD 2007»
15 years 4 months ago
Assisting XML Schema Evolution that Preserves Validity
Abstract. We consider the problem of XML schema evolution preserving the validity of existing documents related to the original schema. The aim of such schema evolution is to fit ...
Béatrice Bouchou, Denio Duarte
NIPS
2004
15 years 4 months ago
Sampling Methods for Unsupervised Learning
We present an algorithm to overcome the local maxima problem in estimating the parameters of mixture models. It combines existing approaches from both EM and a robust fitting algo...
Robert Fergus, Andrew Zisserman, Pietro Perona
165
Voted
NIPS
2003
15 years 4 months ago
Learning Non-Rigid 3D Shape from 2D Motion
This paper presents an algorithm for learning the time-varying shape of a non-rigid 3D object from uncalibrated 2D tracking data. We model shape motion as a rigid component (rotat...
Lorenzo Torresani, Aaron Hertzmann, Christoph Breg...
126
Voted
AAAI
1994
15 years 3 months ago
Formalizing Ontological Commitment
Formalizing the ontological commitment of a logical language means offering a way to specify the intended meaning of its vocabulary by constraining the set of its models, giving e...
Nicola Guarino, Massimiliano Carrara, Pierdaniele ...