Sciweavers

1717 search results - page 119 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
205
Voted
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 7 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
BMCBI
2006
138views more  BMCBI 2006»
15 years 7 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
WADS
2009
Springer
245views Algorithms» more  WADS 2009»
16 years 1 months ago
Online Square Packing
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
Sándor P. Fekete, Tom Kamphans, Nils Schwee...
181
Voted
IBPRIA
2007
Springer
16 years 1 months ago
Bayesian Oil Spill Segmentation of SAR Images Via Graph Cuts
Abstract. This paper extends and generalizes the Bayesian semisupervised segmentation algorithm [1] for oil spill detection using SAR images. In the base algorithm on which we buil...
Sónia Pelizzari, José M. Bioucas-Dia...
COCOON
2001
Springer
15 years 11 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu