3894 search results - page 145 / 779 » Approximation Algorithms for Biclustering Problems |
164
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
190
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
167
click to vote
SIROCCO
2004
15 years 8 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
161
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
171
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...