3495 search results - page 118 / 699 » On the random satisfiable process |
107
Voted
IJAC
2008
15 years 1 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
205
Voted
CVPR
2011
IEEE
14 years 4 months ago
2011
IEEE
How many people should you ask if you are not sure about your way? We provide an answer to this question for Random Forest classification. The presented method is based on the st...
CRYPTO
1993
Springer
15 years 5 months ago
1993
Springer
Cryptographic techniques have been used intensively in the past to show how to play multiparty games in an adversarial scenario. We now investigate the cryptographic power of a dec...
100
Voted
FSE
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either...
120
Voted
PATAT
2000
Springer
15 years 4 months ago
2000
Springer
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...