Sciweavers

2853 search results - page 340 / 571
» On the Efficiency of Provenance Queries
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 6 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
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...
Songrit Maneewongvatana, David M. Mount
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
15 years 1 months ago
Durable top-k search in document archives
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...
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
16 years 8 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
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...
JCDL
2006
ACM
106views Education» more  JCDL 2006»
16 years 18 days ago
Facilitating access to large digital oral history archives through informedia technologies
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 ...
NIPS
2001
15 years 8 months ago
Active Information Retrieval
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...
Tommi Jaakkola, Hava T. Siegelmann