301 search results - page 24 / 61 » Efficient Sketches for the Set Query Problem |
123
click to vote
ALENEX
2001
15 years 12 days ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
CCS
2006
ACM
15 years 2 months ago
2006
ACM
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search...
SIGMOD
2008
ACM
14 years 11 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
PODS
2006
ACM
15 years 11 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
198
Voted
ICDE
2008
IEEE
16 years 11 days ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...