497 search results - page 29 / 100 » Approximating max-min linear programs with local algorithms |
142
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
226
Voted
AAAI
2010
15 years 5 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
114
Voted
ECIR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In this work we study the theoretical and empirical properties of various global inference algorithms for multi-document summarization. We start by defining a general fr...
157
Voted
HYBRID
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
156
Voted
COCO
1993
Springer
15 years 7 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...