Sciweavers

317 search results - page 40 / 64
» Factoring logic functions using graph partitioning
Sort
View
ML
2006
ACM
143views Machine Learning» more  ML 2006»
14 years 9 months ago
Mathematical applications of inductive logic programming
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
Simon Colton, Stephen Muggleton
PODS
2006
ACM
104views Database» more  PODS 2006»
15 years 9 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
ECBS
2010
IEEE
146views Hardware» more  ECBS 2010»
15 years 3 months ago
Design-Space Exploration through Constraint-Based Model-Transformation
Abstract—Many design steps during system development like functional partitioning, refactoring of the architecture, or the mapping to the platform - can be understood as an explo...
Bernhard Schätz, Florian Hölzl, Torbj&ou...
65
Voted
NIPS
2000
14 years 11 months ago
Second Order Approximations for Probability Models
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
Hilbert J. Kappen, Wim Wiegerinck
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
15 years 7 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor