3628 search results - page 306 / 726 » The Decision Diffie-Hellman Problem |
219
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
219
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
155
click to vote
ISAAC
2004
Springer
16 years 1 days ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
147
click to vote
ICCBR
2003
Springer
15 years 12 months ago
2003
Springer
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
190
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...