Sciweavers

5329 search results - page 64 / 1066
» The Weighted Majority Algorithm
Sort
View
IJFCS
2006
91views more  IJFCS 2006»
13 years 7 months ago
Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
Heikki Hyyrö, Gonzalo Navarro
ALGORITHMICA
2011
13 years 2 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
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...
Asaf Shapira, Raphael Yuster, Uri Zwick
NAACL
2003
13 years 9 months ago
Simpler and More General Minimization for Weighted Finite-State Automata
Previous work on minimizing weighted finite-state automata (including transducers) is limited to particular types of weights. We present efficient new minimization algorithms th...
Jason Eisner
CGF
2010
82views more  CGF 2010»
13 years 7 months ago
Poisson-Based Weight Reduction of Animated Meshes
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...
Eric Landreneau, Scott Schaefer
ICALP
2001
Springer
14 years 5 days ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
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 ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan