Sciweavers

106 search results - page 8 / 22
» Admissible Representations of Probability Measures
Sort
View
FLAIRS
2007
13 years 10 months ago
Structure Information in Decision Trees and Similar Formalisms
In attempting to address real-life decision problems, where uncertainty about input data prevails, some kind of representation of imprecise information is important and several ha...
Mats Danielson, Love Ekenberg, David Sundgren
TSMC
1998
108views more  TSMC 1998»
13 years 7 months ago
The measurement of a design structural and functional complexity
— The complexity of a design process or a design artifact substantially influences their performance. When evaluation of terms such as “design complexity” and its “quality...
Dan Braha, Oded Maimon
WACV
2008
IEEE
14 years 2 months ago
Mosaicfaces: a discrete representation for face recognition
Most face recognition algorithms use a “distancebased” approach: gallery and probe images are projected into a low dimensional feature space and decisions about matching are b...
Jania Aghajanian, Simon J. D. Prince
DAS
2010
Springer
13 years 11 months ago
A kernel-based approach to document retrieval
In this paper we tackle the problem of document image retrieval by combining a similarity measure between documents and the probability that a given document belongs to a certain ...
Albert Gordo, Jaume Gibert, Ernest Valveny, Mar&cc...
ECSQARU
2005
Springer
14 years 1 months ago
Probabilistic Graphical Models for the Diagnosis of Analog Electrical Circuits
We describe an algorithm to build a graphical model—more precisely: a join tree representation of a Markov network—for a steady state analog electrical circuit. This model can ...
Christian Borgelt, Rudolf Kruse