Sciweavers

2223 search results - page 260 / 445
» Query Optimization in an OODBMS
Sort
View
ICCV
2007
IEEE
16 years 6 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas
WWW
2008
ACM
16 years 5 months ago
Composing and optimizing data providing web services
In this paper, we propose a new approach to automatically compose data providing Web services. Our approach exploits existing mature works done in data integration systems. Specif...
Mahmoud Barhamgi, Djamal Benslimane, Aris M. Oukse...
KDD
2002
ACM
169views Data Mining» more  KDD 2002»
16 years 5 months ago
Optimizing search engines using clickthrough data
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system shoul...
Thorsten Joachims
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 5 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
GLOBECOM
2008
IEEE
15 years 11 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong