248 search results - page 35 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
STOC
2004
ACM
16 years 1 days ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
ACL
2003
15 years 1 months ago
2003
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...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
109
click to vote
COLING
2010
14 years 6 months ago
2010
In this paper we propose a novel algorithm for opinion summarization that takes account of content and coherence, simultaneously. We consider a summary as a sequence of sentences ...
ICDCN
2009
Springer
15 years 4 months ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...