1414 search results - page 188 / 283 » Randomness and Universal Machines |
150
Voted
STOC
2007
ACM
16 years 3 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...
125
click to vote
CONCUR
2009
Springer
15 years 10 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). ...
133
Voted
ESWS
2007
Springer
15 years 9 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,...
117
Voted
SIGMOD
1998
ACM
15 years 7 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...
150
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...