Sciweavers

3192 search results - page 70 / 639
» The minimum latency problem
Sort
View
142
Voted
STACS
2005
Springer
15 years 9 months ago
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
Telikepalli Kavitha, Kurt Mehlhorn
93
Voted
DAM
2010
86views more  DAM 2010»
15 years 3 months ago
Minimum fill-in and treewidth of split+ke and split+kv graphs
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...
Federico Mancini
140
Voted
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 10 months ago
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
Mehdi Molkaraie, Payam Pakzad
ACL
2012
13 years 6 months ago
Text Segmentation by Language Using Minimum Description Length
The problem addressed in this paper is to segment a given multilingual document into segments for each language and then identify the language of each segment. The problem was mot...
Hiroshi Yamaguchi, Kumiko Tanaka-Ishii
120
Voted
WABI
2005
Springer
15 years 9 months ago
Minimum Recombination Histories by Branch and Bound
Recombination plays an important role in creating genetic diversity within species, and inferring past recombination events is central to many problems in genetics. Given a set M o...
Rune B. Lyngsø, Yun S. Song, Jotun Hein