876 search results - page 78 / 176 » Limits on the Usefulness of Random Oracles |
108
Voted
UAI
2008
15 years 2 months ago
2008
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
89
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
The problem of guessing a random string is revisited and some prior results on guessing exponents are re-derived using the theory of large deviations. It is shown that if the seque...
CORR
2008
Springer
15 years 26 days ago
2008
Springer
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
98
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
109
Voted
ICWS
2007
IEEE
15 years 2 months ago
2007
IEEE
Workflows often operate in volatile environments in which the component services’ QoS changes frequently. Optimally adapting to these changes becomes an important problem that ...