133 search results - page 13 / 27 » Approximating the Minimum Weight Triangulation |
151
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
131
click to vote
STACS
2001
Springer
15 years 6 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
97
Voted
EMNLP
2008
15 years 3 months ago
2008
We present Minimum Bayes-Risk (MBR) decoding over translation lattices that compactly encode a huge number of translation hypotheses. We describe conditions on the loss function t...
136
click to vote
DISOPT
2010
15 years 1 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
132
click to vote
CATS
2006
15 years 3 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...