265 search results - page 27 / 53 » How Many Query Superpositions Are Needed to Learn |
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
PVLDB
2008
13 years 7 months ago
2008
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—“Big Data” in map-reduce (M-R) clusters is often fundamentally temporal in nature, as are many analytics tasks over such data. For instance, display advertising uses Behavio...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
Users’ search needs are often represented by words and images are retrieved according to such textual queries. Annotation words assigned to the stored images are most useful to ...