791 search results - page 99 / 159 » Approximating the Maximum Sharing Problem |
JACM
2007
13 years 7 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
AAIM
2009
Springer
14 years 2 months ago
2009
Springer
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
COLING
1992
13 years 9 months ago
1992
In this paper, a discrimination and robusmess oriented adaptive learning procedure is proposed to deal with the task of syntactic ambiguity resolution. Owing to the problem of ins...
CIKM
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
MEMICS
2010
13 years 2 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...