Sciweavers

3422 search results - page 569 / 685
» Random Subset Optimization
Sort
View
133
Voted
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
16 years 3 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
109
Voted
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 3 months ago
Practical guide to controlled experiments on the web: listen to your customers not to the hippo
The web provides an unprecedented opportunity to evaluate ideas quickly using controlled experiments, also called randomized experiments (single-factor or factorial designs), A/B ...
Ron Kohavi, Randal M. Henne, Dan Sommerfield
173
Voted
MOBIHOC
2007
ACM
16 years 2 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
178
Voted
MOBIHOC
2005
ACM
16 years 2 months ago
Inducing spatial clustering in MAC contention for spread spectrum ad hoc networks
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...
Xiangying Yang, Gustavo de Veciana
94
Voted
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
16 years 4 days ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick