3495 search results - page 283 / 699 » On the random satisfiable process |
208
click to vote
IANDC
2008
15 years 7 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
177
click to vote
JSAT
2006
15 years 7 months ago
2006
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
212
click to vote
MICCAI
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
148
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper, we develop a new tool, called Component Analysis (CA), to study the significance of long Torah Code phrases. CA quantifies the relevance of such a phrase, by compar...
161
click to vote
DAC
2002
ACM
16 years 8 months ago
2002
ACM
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...