37 search results - page 8 / 8 » Tight lower bounds for selection in randomly ordered streams |
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...