17770 search results - page 218 / 3554 » A Generalization of Forward-Backward Algorithm |
182
click to vote
ILP
2000
Springer
15 years 10 months ago
2000
Springer
A framework for combining Genetic Algorithms with ILP methods is introduced and a novel binary representation and relevant genetic operators are discussed. It is shown that the pro...
182
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
236
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
156
click to vote
IPL
2006
15 years 6 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
171
click to vote
WDAG
2004
Springer
16 years 23 hour 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...