7150 search results - page 1383 / 1430 » An Approximation Algorithm for Approximation Rank |
237
Voted
VLDB
2006
ACM
16 years 2 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
218
Voted
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
211
Voted
VLDB
2008
ACM
16 years 2 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
234
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
219
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
The skyline of a d-dimensional dataset consists of all points not dominated by others. The incorporation of the skyline operator into practical database systems necessitates an ef...