This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
In this paper, we present a new algorithm for tracking the generalized signal subspace recursively. It is based on an interpretation of the generalized signal subspace as the solu...
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
The context of this work is lateral vehicle control using a camera as a sensor. A natural tool for controlling a vehicle is recursive filtering. The well-known Kalman fil...
Jean-Philippe Tarel, Sio-Song Ieng, Pierre Charbon...
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...