153 search results - page 27 / 31 » ais 2005 |
PKC
2005
Springer
14 years 26 days ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
RECOMB
2005
Springer
14 years 26 days ago
2005
Springer
Phenotypic differences between closely-related species may arise from differential expression regimes, rather than different gene complements. Knowledge of cellular protein levels ...
SAT
2005
Springer
14 years 26 days ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
WILF
2005
Springer
14 years 26 days ago
2005
Springer
We have developed and continue to enhance automated intelligent software that performs the tasks and decision making which now occurs by the personnel manning watch stations in the...
AAAI
2008
13 years 9 months ago
2008
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...