Sciweavers

121 search results - page 18 / 25
» Improving branch-and-cut performance by random sampling
Sort
View
DL
2000
Springer
173views Digital Library» more  DL 2000»
15 years 2 months ago
Content-based book recommending using learning for text categorization
Recommender systems improve access to relevant products and information by making personalized suggestions based on previous examples of a user's likes and dislikes. Most exi...
Raymond J. Mooney, Loriene Roy
AAAI
2007
15 years 26 days ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
ICASSP
2008
IEEE
15 years 5 months ago
Compressive wireless arrays for bearing estimation
Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the sum of the individual sensor processing result...
Volkan Cevher, Ali Cafer Gurbuz, James H. McClella...
ILP
2004
Springer
15 years 3 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
MICCAI
2010
Springer
14 years 9 months ago
Agreement-Based Semi-supervised Learning for Skull Stripping
Abstract. Learning-based approaches have become increasingly practical in medical imaging. For a supervised learning strategy, the quality of the trained algorithm (usually a class...
Juan Eugenio Iglesias, Cheng-Yi Liu, Paul M. Thomp...