Abstract: We consider the Max Directed 3-Section problem, which is closely connected to other well-known graph partition problems, such as Max Cut and Max Bisection. Given an arc-weighted directed ...
Abstract: Anomaly detection needs to learn one-class classifiers from normal instances in observation or feature spaces. In the Neyman–Pearson criterion, the design of one-class classifiers boils down ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback