308 search results - page 49 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
60
Voted
COLT
2004
Springer
15 years 3 months 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...
91
Voted
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
71
Voted
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
We give new recursive constructions of complete caps in PG(n, 2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to ...
82
Voted
COLT
2004
Springer
15 years 1 months ago
2004
Springer
We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after gues...