1159 search results - page 114 / 232 » Binary Decision Graphs |
152
click to vote
MFCS
2007
Springer
16 years 16 days ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
179
click to vote
WEBDB
2004
Springer
15 years 11 months ago
2004
Springer
Web site structures are complex to analyze. Cross-referencing the web structure with navigational behaviour adds to the complexity of the analysis. However, this convoluted analys...
195
click to vote
MLDM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
186
click to vote
NAACL
2007
15 years 7 months ago
2007
We introduce a simple opinion mining system for analyzing Japanese Weblog reviews called OMS-J. OMS-J is designed to provide an intuitive visual GUI of opinion mining graphs for a...
195
click to vote
DAM
2002
15 years 6 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...