111 search results - page 8 / 23 » Randomized computations on large data sets: tight lower boun... |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
77
Voted
NIPS
2004
14 years 11 months ago
2004
In the context of binary classification, we define disagreement as a measure of how often two independently-trained models differ in their classification of unlabeled data. We exp...
65
Voted
TIT
2011
14 years 4 months ago
2011
—This work first presents a general technique to compute tight upper and lower bounds on the information rate of a multiuser Rayleigh fading channel with no Channel State Inform...
109
Voted
ASIAN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
100
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We address the problem of parameter estimation in presence
of both uncertainty and outlier noise. This is a common
occurrence in computer vision: feature localization
is perform...