| Virual Oral Presentation Slide by Slide |
IEEE/ICACT20260019 Slide.17
[Big Slide]
[YouTube] |
Oral Presentation |
|
|
Decision Tree (DT) delivers the lowest per-sample latency but sacrifices robustness compared to ensemble methods. Random Forest (RF) achieves perfect detection performance while maintaining deployable latency on SmartNIC-class hardware. K-Nearest Neighbors (KNN), despite high accuracy, exhibits prohibitively high inference latency, making it unsuitable for real-time deployment. | |
| [Go to Next Slide] |