3894 search results - page 532 / 779 » Approximation Algorithms for Biclustering Problems |
130
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
143
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
131
click to vote
DAM
2011
14 years 11 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...
207
Voted
COMPGEOM
2011
ACM
14 years 7 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...
138
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...