Sciweavers

478 search results - page 24 / 96
» Local Search for Computing Normal Circumstances Models
Sort
View
CSDA
2007
94views more  CSDA 2007»
13 years 10 months ago
Some extensions of score matching
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...
Aapo Hyvärinen
ATAL
2011
Springer
12 years 10 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...
PR
2008
218views more  PR 2008»
13 years 10 months ago
Automatic feature localisation with constrained local models
We present an efficient and robust method of locating a set of feature points in an object of interest. From a training set we construct a joint model of the appearance of each fe...
David Cristinacce, Timothy F. Cootes
ICCV
2007
IEEE
15 years 8 days ago
Contour Grouping Based on Local Symmetry
The paper deals with grouping of edges to contours of shapes using only local symmetry and continuity. Shape skeletons are used to generate the search space for a version of the M...
Nagesh Adluru, Longin Jan Latecki, Rolf Lakäm...
SPIN
2005
Springer
14 years 3 months ago
Improving Spin's Partial-Order Reduction for Breadth-First Search
We describe an improvement of the partial-order reduction algorithm for breadth-first search which was introduced in Spin version 4.0. Our improvement is based on the algorithm by...
Dragan Bosnacki, Gerard J. Holzmann