3894 search results - page 327 / 779 » Approximation Algorithms for Biclustering Problems |
193
click to vote
ICRA
2008
IEEE
16 years 23 days ago
2008
IEEE
— The lack of a parameterized observation model in robot localization using occupancy grids requires the application of sampling-based methods, or particle filters. This work ad...
206
click to vote
COCOA
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
136
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
137
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
220
click to vote
STOC
2012
ACM
13 years 8 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...