Sciweavers

144 search results - page 15 / 29
» Non-blocking binary search trees
Sort
View
DAC
2003
ACM
15 years 10 months ago
Automated synthesis of efficient binary decoders for retargetable software toolkits
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
Wei Qin, Sharad Malik
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 3 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
IJCAI
2007
14 years 11 months ago
Extracting Propositional Rules from Feed-forward Neural Networks - A New Decompositional Approach
In this paper, we present a new decompositional approach for the extraction of propositional rules from feed-forward neural networks of binary threshold units. After decomposing t...
Sebastian Bader, Steffen Hölldobler, Valentin...
SIGCSE
2012
ACM
310views Education» more  SIGCSE 2012»
13 years 5 months ago
CSTutor: a pen-based tutor for data structure visualization
We present CSTutor, a sketch-based interface designed to help students understand data structures. It currently supports Linked Lists, Binary Search Trees, AVL Trees, and Heaps, a...
Sarah Buchanan, Brandon Ochs, Joseph J. LaViola Jr...