Sciweavers

2136 search results - page 321 / 428
» Improving on Expectation Propagation
Sort
View
FOCS
2004
IEEE
15 years 1 months ago
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...
ECML
2006
Springer
15 years 1 months ago
Learning Stochastic Tree Edit Distance
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
Marc Bernard, Amaury Habrard, Marc Sebban
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
15 years 1 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
GECCO
2006
Springer
226views Optimization» more  GECCO 2006»
15 years 1 months ago
Segmentation of medical images using a genetic algorithm
Segmentation of medical images is challenging due to poor image contrast and artifacts that result in missing or diffuse organ/tissue boundaries. Consequently, this task involves ...
Payel Ghosh, Melanie Mitchell
GCB
2000
Springer
137views Biometrics» more  GCB 2000»
15 years 1 months ago
Detecting Sporadic Recombination in DNA Alignments with Hidden Markov Models
Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets fro...
Dirk Husmeier, Frank Wright