17760 search results - page 184 / 3552 » A Generalization of the Massey-Ding Algorithm |
134
click to vote
WDAG
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
139
click to vote
WABI
2007
Springer
15 years 10 months ago
2007
Springer
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
121
click to vote
AMC
2007
15 years 4 months ago
2007
In 2006, Blake, Murty and Xu proposed three refinements to Miller’s algorithm for computing Weil/Tate Pairings. In this paper we extend their work and propose a generalized algo...
125
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Ongoing research has established a new methodology for using genetic algorithms [2] to evolve forward and inverse transforms that significantly reduce quantization error in recons...
119
click to vote
APPROX
2000
Springer
15 years 8 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...