Sciweavers

1034 search results - page 71 / 207
» Inference of field initialization
Sort
View
UAI
2008
15 years 1 months ago
Sensitivity analysis for finite Markov chains in discrete time
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering a...
Gert De Cooman, Filip Hermans, Erik Quaeghebeur
SDM
2004
SIAM
224views Data Mining» more  SDM 2004»
15 years 1 months ago
Hierarchical Clustering for Thematic Browsing and Summarization of Large Sets of Association Rules
In this paper we propose a method for grouping and summarizing large sets of association rules according to the items contained in each rule. We use hierarchical clustering to par...
Alípio Jorge
SIAMCO
2000
71views more  SIAMCO 2000»
14 years 11 months ago
Any Domain of Attraction for a Linear Constrained System is a Tracking Domain of Attraction
We face the problem of determining a tracking domain of attraction, say the set of initial states starting from which it is possible to track reference signals in given class, for...
Franco Blanchini, Stefano Miani
CVPR
2007
IEEE
16 years 1 months ago
An MRF and Gaussian Curvature Based Shape Representation for Shape Matching
Matching and registration of shapes is a key issue in Computer Vision, Pattern Recognition, and Medical Image Analysis. This paper presents a shape representation framework based ...
Pengdong Xiao, Nick Barnes, Tibério S. Caet...
AAAI
1996
15 years 1 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace