Sciweavers

2735 search results - page 230 / 547
» Comparing notions of randomness
Sort
View
114
Voted
QUESTA
2006
100views more  QUESTA 2006»
15 years 17 days ago
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
We compare the performance of three usual allocations (max-min fairness, proportional fairness and balanced fairness) in a communication network whose resources are shared by a ra...
Thomas Bonald, Laurent Massoulié, Alexandre...
106
Voted
ACL
2009
14 years 10 months ago
Semi-Supervised Active Learning for Sequence Labeling
While Active Learning (AL) has already been shown to markedly reduce the annotation efforts for many sequence labeling tasks compared to random selection, AL remains unconcerned a...
Katrin Tomanek, Udo Hahn
CORR
2011
Springer
140views Education» more  CORR 2011»
14 years 7 months ago
Sampling-rate-aware noise generation
In this paper we consider the generation of discrete white noise. Despite this seems to be a simple problem, common noise generator implementations do not deliver comparable resul...
Henning Thielemann
95
Voted
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
15 years 7 months ago
Pseudorandom Generators and Typically-Correct Derandomization
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
FOCS
2008
IEEE
15 years 7 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...