867 search results - page 4 / 174 » The Generalized Maximum Coverage Problem |
COLING
2002
13 years 7 months ago
2002
With the rapid growth of real world applications for NLP systems, there is a genuine demand for a general toolkit from which programmers with no linguistic knowledge can build spe...
CN
2010
13 years 7 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
IPCO
1998
13 years 9 months ago
1998
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
JCNS
2010
13 years 2 months ago
2010
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
CCCG
2007
13 years 9 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...