13 search results - page 3 / 3 » Error-bounded probabilistic computations between MA and AM |
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and U...
102
click to vote
COCO
1994
Springer
15 years 1 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
JAL
2002
14 years 9 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...