5329 search results - page 64 / 1066 » The Weighted Majority Algorithm |
100
click to vote
IJFCS
2006
14 years 11 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
165
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
NAACL
2003
15 years 1 months ago
2003
Previous work on minimizing weighted finite-state automata (including transducers) is limited to particular types of weights. We present efficient new minimization algorithms th...
CGF
2010
14 years 12 months ago
2010
While animation using barycentric coordinates or other automatic weight assignment methods has become a popular method for shape deformation, the global nature of the weights limi...
140
click to vote
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...