Sciweavers

1159 search results - page 38 / 232
» Binary Decision Graphs
Sort
View
ICONIP
2009
13 years 6 months ago
HumanBoost: Utilization of Users' Past Trust Decision for Identifying Fraudulent Websites
In this paper, we present an approach that aims to study users' past trust decisions (PTDs) for improving the accuracy of detecting phishing sites. Generally, Web users requir...
Daisuke Miyamoto, Hiroaki Hazeyama, Youki Kadobaya...
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
14 years 3 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
KBS
2002
106views more  KBS 2002»
13 years 8 months ago
Hybrid decision tree
In this paper, a hybrid learning approach named HDT is proposed. HDT simulates human reasoning by using symbolic learning to do qualitative analysis and using neural learning to d...
Zhi-Hua Zhou, Zhaoqian Chen
CCCG
1998
13 years 10 months ago
Proximity drawings of binary trees in polynomial area
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
Paolo Penna, Paola Vocca
4OR
2007
103views more  4OR 2007»
13 years 9 months ago
Compact linearization for binary quadratic problems
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
Leo Liberti