210 search results - page 38 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
ACL
2007
13 years 9 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
WABI
2009
Springer
14 years 2 months ago
2009
Springer
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
VLDB
2004
ACM
14 years 7 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...