Sciweavers

3359 search results - page 344 / 672
» A Simplified Idea Algorithm
Sort
View
CSCLP
2008
Springer
15 years 4 months ago
Challenges in Constraint-Based Analysis of Hybrid Systems
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
Andreas Eggers, Natalia Kalinnik, Stefan Kupfersch...
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 4 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze
AAAI
2006
15 years 4 months ago
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guo...
UAI
2003
15 years 4 months ago
Robust Independence Testing for Constraint-Based Learning of Causal Structure
This paper considers a method that combines ideas from Bayesian learning, Bayesian network inference, and classical hypothesis testing to produce a more reliable and robust test o...
Denver Dash, Marek J. Druzdzel
150
Voted
JAIR
2006
143views more  JAIR 2006»
15 years 3 months ago
Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
Tom Heskes