The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
Traditional Active Learning (AL) techniques assume that the annotation of each datum costs the same. This is not the case when annotating sequences; some sequences will take longe...
Robbie Haertel, Eric K. Ringger, Kevin D. Seppi, J...
The ubiquity and capability of off-the-shelf laptop computers offer AI educators remarkable opportunities to reach broadly across the subfields of AI. By leveraging student laptop...
Supervised learning deals with the inference of a distribution over an output or label space Y conditioned on points in an observation space X , given a training dataset D of pair...
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....