11231 search results - page 244 / 2247 » Digging for Data Structures |
167
click to vote
ADMA
2006
Springer
16 years 17 days ago
2006
Springer
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
161
click to vote
EDCC
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. Current paper proposes an efficient alternative for traditional gatelevel fault simulation. The authors explain how Structurally Synthesized Binary Decision Diagrams (SSB...
180
click to vote
IV
2003
IEEE
15 years 12 months ago
2003
IEEE
It is often useful to get high-level views of datasets in order to identify areas of interest worthy of further exploration. In relational databases, the high-level view can be de...
172
click to vote
KDD
1995
ACM
15 years 10 months ago
1995
ACM
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
171
click to vote
UAI
2008
15 years 8 months ago
2008
In many machine learning problems, labeled training data is limited but unlabeled data is ample. Some of these problems have instances that can be factored into multiple views, ea...