Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
This paper discusses the application of speech alignment, image processing, and language understanding technologies to build efficient interfaces into large digital oral history a...
Michael G. Christel, Julieanna Richardson, Howard ...
When a client interacts with an expert, e.g. a doctor, it falls upon the expert to ask questions that steer the process towards fulfilling the client's needs. This is most ef...