551 search results - page 12 / 111 » The Complexity of Andersen's Analysis in Practice |
PRL
2006
13 years 6 months ago
2006
Regularized linear classifiers have been successfully applied in undersampled, i.e. small sample size/high dimensionality biomedical classification problems. Additionally, a desig...
JCST
2010
13 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
ICNP
2005
IEEE
14 years 9 days ago
2005
IEEE
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
NIPS
2007
13 years 8 months ago
2007
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...