7015 search results - page 169 / 1403 » Approximation algorithms for co-clustering |
138
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
140
click to vote
STOC
2003
ACM
16 years 3 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...
116
Voted
STOC
2004
ACM
16 years 3 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...
133
click to vote
RECOMB
2004
Springer
16 years 3 months ago
2004
Springer
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
129
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...