5105 search results - page 872 / 1021 » An algorithm to determine peer-reviewers |
176
click to vote
FC
1998
Springer
15 years 10 months ago
1998
Springer
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...
178
click to vote
ISTCS
1997
Springer
15 years 10 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
186
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
156
click to vote
WDAG
1990
Springer
15 years 10 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
171
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...