Sciweavers

1492 search results - page 103 / 299
» Testing Properties of Constraint-Graphs
Sort
View
UAI
1996
15 years 5 months ago
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
Yousri El Fattah, Rina Dechter
TEC
2002
128views more  TEC 2002»
15 years 3 months ago
A framework for evolutionary optimization with approximate fitness functions
It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are...
Yaochu Jin, Markus Olhofer, Bernhard Sendhoff
ENTCS
2011
99views more  ENTCS 2011»
14 years 10 months ago
Symmetry and Composition in Probabilistic Theories
The past decade has seen a remarkable resurgence of the old programme of finding more or less a priori axioms for the mathematical framework of quantum mechanics. The new impetus...
Alexander Wilce
SPEECH
2011
14 years 10 months ago
Role of modulation magnitude and phase spectrum towards speech intelligibility
In this paper our aim is to investigate the properties of the modulation domain and more specifically, to evaluate the relative contributions of the modulation magnitude and phas...
Kuldip K. Paliwal, Belinda Schwerin, Kamil K. W&oa...
TVCG
2011
171views more  TVCG 2011»
14 years 10 months ago
Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs
—In this paper, we present the results of a human computer interaction experiment that compared the performance of the animation of dynamic graphs to the presentation of small mu...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...