Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
Apostolos N. Papadopoulos, Alexandros Nanopoulos, ...
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
There is an increasing trends towards distributed and shared repositories for storing scientific datasets. Developing applications that retrieve and process data from such reposit...
Efficient storage and retrieval of large multidimensional datasets is an important concernfor large-scale scientific computations such as long-running time-dependent simulations w...
We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences...
Huma Lodhi, John Shawe-Taylor, Nello Cristianini, ...