We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
There are many applications available for phishing detection. However, unlike predicting spam, there are only few studies that compare machine learning techniques in predicting ph...
Saeed Abu-Nimeh, Dario Nappa, Xinlei Wang, Suku Na...
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
— In this paper we present a systematic study of the performance of seven different configurations of GPS on a moving vehicle using three different GPS receivers. The seven diff...