Sciweavers

1940 search results - page 150 / 388
» Graph Transformation with Variables
Sort
View
133
Voted
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 5 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
130
Voted
UAI
2008
15 years 5 months ago
Inference for Multiplicative Models
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabi...
Ydo Wexler, Christopher Meek
VLDB
1993
ACM
121views Database» more  VLDB 1993»
15 years 7 months ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis
145
Voted
SAT
2009
Springer
117views Hardware» more  SAT 2009»
15 years 10 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
ICCAD
2007
IEEE
87views Hardware» more  ICCAD 2007»
16 years 13 days ago
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
Philip Brisk, Ajay K. Verma, Paolo Ienne