Sciweavers

8398 search results - page 1486 / 1680
» Optimal Software Testing
Sort
View
BMCBI
2006
137views more  BMCBI 2006»
15 years 6 months ago
A maximum likelihood framework for protein design
Background: The aim of protein design is to predict amino-acid sequences compatible with a given target structure. Traditionally envisioned as a purely thermodynamic question, thi...
Claudia L. Kleinman, Nicolas Rodrigue, Céci...
COR
2006
97views more  COR 2006»
15 years 6 months ago
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets
IJCV
2006
299views more  IJCV 2006»
15 years 6 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
NN
2008
Springer
143views Neural Networks» more  NN 2008»
15 years 6 months ago
A batch ensemble approach to active learning with model selection
Optimally designing the location of training input points (active learning) and choosing the best model (model selection) are two important components of supervised learning and h...
Masashi Sugiyama, Neil Rubens
MANSCI
2007
90views more  MANSCI 2007»
15 years 6 months ago
Selecting a Selection Procedure
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...
Jürgen Branke, Stephen E. Chick, Christian Sc...
« Prev « First page 1486 / 1680 Last » Next »