41 search results - page 5 / 9 » Lower Bounds on Learning Random Structures with Statistical ... |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
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 ...
NIPS
2008
13 years 9 months ago
2008
We investigate a topic at the interface of machine learning and cognitive science. Human active learning, where learners can actively query the world for information, is contraste...
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
The goal of a statistical database is to provide statistics about a population while simultaneously protecting the privacy of the individual records in the database. The tension be...
COLT
2004
Springer
14 years 28 days ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...