787 search results - page 147 / 158 » Polynomial Constants are Decidable |
143
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
150
click to vote
LOGCOM
2010
14 years 11 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
146
click to vote
CAV
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Many automatic testing, analysis, and verification techniques for programs can effectively be reduced to a constraint-generation phase followed by a constraint-solving ...
136
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
127
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...