440 search results - page 33 / 88 » On partial randomness |
ESWS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In an open environment populated by heterogeneous information services integration will be a major challenge. Even if the problem is similar to planning in some aspects, ...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
ECCV
1998
Springer
16 years 1 months ago
1998
Springer
Assume that some objects are present in an image but can be seen only partially and are overlapping each other. To recognize the objects, we have to rstly separate the objects from...
ASIACRYPT
2008
Springer
15 years 1 months ago
2008
Springer
Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help o...
WWW
2004
ACM
16 years 13 days ago
2004
ACM
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...