Sciweavers

1101 search results - page 21 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
AINA
2003
IEEE
15 years 1 months ago
Signature Schemes Based on Two Hard Problems Simultaneously
In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....
Ching-Te Wang, Chu-Hsing Lin, Chin-Chen Chang
RECOMB
2001
Springer
15 years 10 months ago
Applications of generalized pair hidden Markov models to alignment and gene finding problems
Hidden Markov models (HMMs) have been successfully applied to a variety of problems in molecular biology, ranging from alignment problems to gene nding and annotation. Alignment p...
Lior Pachter, Marina Alexandersson, Simon Cawley
ATVA
2006
Springer
114views Hardware» more  ATVA 2006»
15 years 1 months ago
Selective Approaches for Solving Weak Games
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
Malte Helmert, Robert Mattmüller, Sven Schewe
SSPR
1998
Springer
15 years 1 months ago
A Statistical Clustering Model and Algorithm
In this paper, a statistical clustering model and algorithm have been discussed. Finding the optimal solution to clustering problem is transformed into simulating the equilibrium ...
Guangwen Yang, Weimin Zheng, Dingxing Wang
SAGA
2009
Springer
15 years 4 months ago
Scenario Reduction Techniques in Stochastic Programming
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
Werner Römisch