17366 search results - page 153 / 3474 » New Revision Algorithms |
135
click to vote
ANSS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper Hidden Markov Model algorithms are considered as a method for computing conditional properties of continuous-time stochastic simulation models. The goal is to develo...
102
click to vote
ISAAC
1994
Springer
15 years 8 months ago
1994
Springer
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...
119
click to vote
ESA
1998
Springer
15 years 8 months ago
1998
Springer
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...
115
click to vote
CSJM
2008
15 years 2 months ago
2008
Faug`ere's criterion used in the F5 algorithm is still not understand and thus there are not many implementations of this algorithm. We state its proof using syzygies to expl...
169
click to vote
CCECE
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...