Sciweavers

666 search results - page 101 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
IPPS
2003
IEEE
14 years 2 months ago
An Extended Link Reversal Protocol in Dynamic Networks
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
Jie Wu, Fei Dai
WLP
1997
Springer
14 years 1 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
CSB
2004
IEEE
126views Bioinformatics» more  CSB 2004»
14 years 26 days ago
Boosted PRIM with Application to Searching for Oncogenic Pathway of Lung Cancer
Boosted PRIM (Patient Rule Induction Method) is a new algorithm developed for two-class classification problems. PRIM is a variation of those Tree-Based methods ( [4] Ch9.3), seek...
Pei Wang, Young Kim, Jonathan R. Pollack, Robert T...
BIBE
2009
IEEE
126views Bioinformatics» more  BIBE 2009»
14 years 4 months ago
Mining Positional Association Super-Rules on Fixed-Size Protein Sequence Motifs
— Protein sequence motifs information is crucial to the analysis of biologically significant regions. The conserved regions have the potential to determine the role of the protei...
Bernard Chen, Sinan Kockara