Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
The suitability of the well known kernels for trees, and the lesser known SelfOrganizing Map for Structures for categorization tasks on structured data is investigated in this pap...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...