2223 search results - page 332 / 445 » Query Optimization in an OODBMS |
156
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
150
click to vote
SBBD
2004
15 years 5 months ago
2004
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
140
click to vote
PAMI
2007
15 years 3 months ago
2007
—This paper presents methods of modeling and predicting face recognition (FR) system performance based on analysis of similarity scores. We define the performance of an FR system...
133
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
K-Nearest Neighbors relies on the definition of a global metric. In contrast, Discriminant Adaptive Nearest Neighbor (DANN) computes a different metric at each query point based o...
133
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...