We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
This paper describes an environment for supporting very large ontologies. The system can be used on single PCs, workstations, a cluster of workstations, and high-end parallel supe...
Kilian Stoffel, Merwyn G. Taylor, James A. Hendler
As a problem of high practical appeal but outstanding challenges, computer-based face recognition remains a topic of extensive research attention. In this paper we are specificall...
The retrieval of videos of interest from large video collections is a main open problem which calls for the definition of new video content characterization techniques in term of ...
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...