Sciweavers

344 search results - page 14 / 69
» The Directed Minimum Latency Problem
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
14 years 9 months ago
Approximating Transitivity in Directed Networks
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
ACL
2003
14 years 10 months ago
Minimum Error Rate Training in Statistical Machine Translation
Often, the training procedure for statistical machine translation models is based on maximum likelihood or related criteria. A general problem of this approach is that there is on...
Franz Josef Och
73
Voted
CCE
2008
14 years 9 months ago
Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
Yi Cao, Vinay Kariwala
95
Voted
ALGORITHMICA
2010
127views more  ALGORITHMICA 2010»
14 years 9 months ago
An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
Satoru Iwata, Yusuke Kobayashi
ALGORITHMICA
2008
83views more  ALGORITHMICA 2008»
14 years 9 months ago
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs
In this paper we consider the p-ary transitive reduction (TRp) problem where p > 0 is an integer; for p = 2 this problem arises in inferring a sparsest possible (biological) sig...
Réka Albert, Bhaskar DasGupta, Riccardo Don...