Sciweavers

5138 search results - page 454 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
CATS
2008
15 years 8 months ago
On the Efficiency of Pollard's Rho Method for Discrete Logarithms
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
Shi Bai, Richard P. Brent
ESANN
2006
15 years 8 months ago
Using sampling methods to improve binding site predictions
Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. In previous work we combine random selection under-sampling with th...
Yi Sun, Mark Robinson, Rod Adams, Rene te Boekhors...
AAAI
1997
15 years 8 months ago
Summarizing CSP Hardness with Continuous Probability Distributions
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
Daniel Frost, Irina Rish, Lluís Vila
CORR
2010
Springer
86views Education» more  CORR 2010»
15 years 7 months ago
Matching with Couples Revisited
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a ge...
Itai Ashlagi, Mark Braverman, Avinatan Hassidim
PROVSEC
2010
Springer
15 years 4 months ago
Identity Based Public Verifiable Signcryption Scheme
Abstract. Signcryption as a single cryptographic primitive offers both confidentiality and authentication simultaneously. Generally in signcryption schemes, the message is hidden a...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...