1279 search results - page 139 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
152
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
138
click to vote
DAM
2011
14 years 12 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
222
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
146
click to vote
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
132
click to vote
ATVA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...