6615 search results - page 17 / 1323 » Indexing Multiple Sets |
144
click to vote
SSDBM
2010
IEEE
15 years 11 months ago
2010
IEEE
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
109
click to vote
ENTCS
2008
15 years 6 months ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
129
click to vote
JCDL
2006
ACM
15 years 12 months ago
2006
ACM
When professional indexers independently assign terms to a given document, the term sets generally differ between indexers. Studies of inter-indexer consistency measure the percen...
121
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
Repositories of multimedia objects having multiple types of attributes e.g., image, text are becoming increasingly common. A selection on these attributes will typically produce n...
263
click to vote
PODS
2009
ACM
16 years 6 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...