Sciweavers

206 search results - page 9 / 42
» An Application of Binary Decision Trees to Pattern Recogniti...
Sort
View
CVPR
2007
IEEE
16 years 4 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
FLAIRS
2004
15 years 3 months ago
Decision Tree Extraction from Trained Neural Networks
Artificial Neural Networks (ANNs) have proved both a popular and powerful technique for pattern recognition tasks in a number of problem domains. However, the adoption of ANNs in ...
Darren Dancey, David McLean, Zuhair Bandar
DAC
2003
ACM
16 years 2 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
DAWAK
2000
Springer
15 years 6 months ago
Mining Frequent Binary Expressions
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
Toon Calders, Jan Paredaens
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
15 years 5 months ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten