1159 search results - page 90 / 232 » Binary Decision Graphs |
182
click to vote
KDD
1994
ACM
15 years 10 months ago
1994
ACM
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
243
click to vote
CSR
2011
Springer
14 years 9 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
166
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
198
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
184
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...