Sciweavers

2740 search results - page 116 / 548
» Approximating Component Selection
Sort
View
BMCBI
2005
118views more  BMCBI 2005»
14 years 10 months ago
Feature selection and nearest centroid classification for protein mass spectrometry
Background: The use of mass spectrometry as a proteomics tool is poised to revolutionize early disease diagnosis and biomarker identification. Unfortunately, before standard super...
Ilya Levner
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
15 years 4 months ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo
CCCG
2010
14 years 11 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
PE
2010
Springer
170views Optimization» more  PE 2010»
14 years 8 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
INFSOF
2002
147views more  INFSOF 2002»
14 years 9 months ago
On the efficiency of domain-based COTS product selection method
Use of commercial-off-the-shelf (COTS) products is becoming a popular software development method. Current methods of selecting COTS products involve using the intuition of softwa...
Karl R. P. H. Leung, Hareton K. N. Leung