58 search results - page 11 / 12 » Competitive Freshness Algorithms for Wait-Free Data Objects |
199
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
122
click to vote
CP
2003
Springer
15 years 3 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
125
click to vote
WEA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
104
click to vote
BMCBI
2008
14 years 10 months ago
2008
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...