9572 search results - page 1802 / 1915 » Cover Algorithms and Their Combination |
257
click to vote
SIGMOD
2009
ACM
16 years 4 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...
228
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
210
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
235
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
205
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...