Information integration systems combine data from multiple heterogeneous Web services to answer complex user queries, provided a user has semantically modeled the service first. T...
Kristina Lerman, Anon Plangprasopchok, Craig A. Kn...
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. CP-nets were designed to make the preference elicitation proces...