492 search results - page 33 / 99 » The number of possibilities for random dating |
140
Voted
ASIACRYPT
2004
Springer
15 years 7 months ago
2004
Springer
We investigate efficient protocols for password-authenticated key exchange based on the RSA public-key cryptosystem. To date, most of the published protocols for password-authentic...
116
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
112
click to vote
JCC
2008
15 years 1 months ago
2008
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
140
click to vote
COLT
2008
Springer
15 years 3 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
108
click to vote
SOFSEM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...