7006 search results - page 218 / 1402 » Approximation Algorithms |
106
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
229
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
140
Voted
SODA
2004
ACM
15 years 4 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...
143
click to vote
ICIP
2000
IEEE
16 years 5 months ago
2000
IEEE
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...
122
Voted
DIS
2007
Springer
15 years 9 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...