3894 search results - page 325 / 779 » Approximation Algorithms for Biclustering Problems |
199
click to vote
TALG
2010
15 years 1 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
183
click to vote
ISSAC
2007
Springer
16 years 26 days ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
205
click to vote
ICST
2010
IEEE
15 years 5 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
176
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
179
Voted
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...