Sciweavers

1159 search results - page 58 / 232
» Binary Decision Graphs
Sort
View
GG
2004
Springer
14 years 2 months ago
Embedding in Switching Classes with Skew Gains
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
CP
2008
Springer
13 years 11 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons
KDD
1999
ACM
185views Data Mining» more  KDD 1999»
14 years 1 months ago
Visual Classification: An Interactive Approach to Decision Tree Construction
Satisfying the basic requirements of accuracy and understandability of a classifier, decision tree classifiers have become very popular. Instead of constructing the decision tree ...
Mihael Ankerst, Christian Elsen, Martin Ester, Han...
JGT
2010
109views more  JGT 2010»
13 years 3 months ago
Homomorphism-homogeneous graphs
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
Momchil Rusinov, Pascal Schweitzer
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 9 months ago
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...