1038 search results - page 196 / 208 » Space-Bounded Query Approximation |
105
click to vote
TKDE
2010
14 years 10 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
TKDE
2010
14 years 10 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
103
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
107
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
112
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...