530 search results - page 91 / 106 » Universal randomized switching |
135
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
111
click to vote
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
118
click to vote
ESWS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Ontologies are now used within an increasing number of realworld applications. So far, significant effort has been spend in building tools to support users in creating,...
107
click to vote
SIGMOD
1998
ACM
15 years 6 months ago
1998
ACM
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
116
click to vote
COLT
2008
Springer
15 years 3 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...