9562 search results - page 1903 / 1913 » The probability of |
SIGECOM
2011
ACM
12 years 11 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
SIGMOD
2011
ACM
12 years 11 months ago
2011
ACM
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
ICCV
2011
IEEE
12 years 9 months ago
2011
IEEE
In object recognition, soft-assignment coding enjoys computational efficiency and conceptual simplicity. However, its classification performance is inferior to the newly develop...
APPROX
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
COCO
2011
Springer
12 years 8 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...