Search Results for author:
Found 6 papers, 0 papers with code
Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation
Extensive evaluations of the proposed method are conducted in comparison to the basic realization of C code from the high-level machine learning model and succeeding compilation.
FLInt: Exploiting Floating Point Enabled Integer Arithmetic for Efficient Random Forest Inference
In this paper, we provide \mdname, a full precision floating point comparison for random forests, by only using integer and logic operations.
Universal Approximation Theorems of Fully Connected Binarized Neural Networks
Neural networks (NNs) are known for their high predictive accuracy in complex learning problems.
Bit Error Tolerance Metrics for Binarized Neural Networks
In this study, our objective is to investigate the internal changes in the NNs that bit flip training causes, with a focus on binarized NNs (BNNs).
Towards Explainable Bit Error Tolerance of Resistive RAM-Based Binarized Neural Networks
Finally, we explore the influence of a novel regularizer that optimizes with respect to this metric, with the aim of providing a configurable trade-off in accuracy and BET.
Reservation-Based Federated Scheduling for Parallel Real-Time Tasks
We provide general constraints for the design of such systems and prove that reservation-based federated scheduling has a constant speedup factor with respect to any optimal DAG task scheduler.
Operating Systems Distributed, Parallel, and Cluster Computing
