7978 search results - page 483 / 1596 » Combining shared-coin algorithms |
171
click to vote
AAECC
2006
Springer
15 years 7 months ago
2006
Springer
Several suggestions are presented for developing cryptosystems, both classical and public key, using a combination of combinatorial group theory and linear groups. In particular, t...
192
click to vote
ISCI
2008
15 years 6 months ago
2008
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
154
click to vote
ENGL
2007
15 years 6 months ago
2007
— In any information system, the reducts are useful in classifying data. Janusz Starzyk developed an algorithm for computing reducts using strong equivalence and the law of expan...
164
click to vote
SIGCSE
2008
ACM
15 years 6 months ago
2008
ACM
: The generalized problem of placing n queens on an n-by-n board provides an "embarrassingly parallel" problem for parallel solution. This paper expands on the discussion...
177
click to vote
ANOR
2002
15 years 6 months ago
2002
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...