7930 search results - page 408 / 1586 » Greedy in Approximation Algorithms |
168
click to vote
ICPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
175
click to vote
ATVA
2005
Springer
16 years 1 months ago
2005
Springer
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
186
click to vote
COCO
2005
Springer
16 years 1 months ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
259
click to vote
ISAAC
2005
Springer
16 years 1 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
242
click to vote
BMCBI
2006
15 years 7 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...