7930 search results - page 277 / 1586 » Greedy in Approximation Algorithms |
176
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...
206
click to vote
RECOMB
2004
Springer
16 years 7 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...
185
click to vote
ICALP
2007
Springer
16 years 1 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...
214
click to vote
ECRTS
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
191
click to vote
CAGD
2005
15 years 7 months ago
2005
In this paper we present an algorithm for parametrizing approximate algebraic surfaces by lines. The algorithm is applicable to -irreducible algebraic surfaces of degree d having ...