860 search results - page 82 / 172 » Lower Bounds on the Size of Test Data 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 ...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
In this paper we study the broadcast capacity of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated in the network such th...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
FOCM
2010
13 years 6 months ago
2010
Abstract. An automated method of general purpose is introduced for computing a rigorous estimate of a bounded region in Rn whose points satisfy a given property. The method is base...