Sciweavers

214 search results - page 5 / 43
» A linear time algorithm for L(2,1)-labeling of trees
Sort
View
COCOA
2010
Springer
14 years 8 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
ECCC
2010
92views more  ECCC 2010»
14 years 8 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau
DGCI
2009
Springer
15 years 1 months ago
A Linear Time and Space Algorithm for Detecting Path Intersection
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
Srecko Brlek, Michel Koskas, Xavier Provenç...
CATS
2007
14 years 11 months ago
A Linear Time Algorithm for Pricing European Sequential Barrier Options
Financial derivatives are contracts concerning rights and obligations to engage in future transactions on some underlying financial instrument. A major concern in financial mark...
Peng Gao, Ron van der Meyden
BMCBI
2010
142views more  BMCBI 2010»
14 years 10 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...