77 search results - page 9 / 16 » Sample Size Lower Bounds in PAC Learning by Algorithmic Comp... |
PODS
2000
ACM
13 years 12 months ago
2000
ACM
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
MST
2011
13 years 2 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
AAMAS
2004
Springer
13 years 7 months ago
2004
Springer
The development of the World Wide Web has changed the way we think about information. Information on the web is distributed, updates are made asynchronously and resources come onli...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
ALT
2010
Springer
13 years 7 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...