42230 search results - page 131 / 8446 » Algorithms and Complexity Results for |
CP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
111
click to vote
TGC
2010
Springer
14 years 7 months ago
2010
Springer
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
BMCBI
2010
14 years 10 months ago
2010
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]....