Sciweavers

432 search results - page 3 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
DM
1998
62views more  DM 1998»
13 years 5 months ago
Bipartite subgraphs of integer weighted graphs
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
Noga Alon, Eran Halperin
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
13 years 3 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick
EMNLP
2009
13 years 3 months ago
First- and Second-Order Expectation Semirings with Applications to Minimum-Risk Training on Translation Forests
Many statistical translation models can be regarded as weighted logical deduction. Under this paradigm, we use weights from the expectation semiring (Eisner, 2002), to compute fir...
Zhifei Li, Jason Eisner
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 6 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon
COR
2008
142views more  COR 2008»
13 years 5 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma