492 search results - page 97 / 99 » Simplifying Probabilistic Programs Using Computer Algebra |
138
click to vote
KBSE
2000
IEEE
15 years 5 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
159
click to vote
WG
2010
Springer
15 years 7 days ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
128
click to vote
CCS
2008
ACM
15 years 3 months ago
2008
ACM
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
118
Voted
BMCBI
2008
15 years 2 months ago
2008
Background: Biologically active sequence motifs often have positional preferences with respect to a genomic landmark. For example, many known transcription factor binding sites (T...
120
click to vote
TPHOL
2007
IEEE
15 years 8 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...