Sciweavers

101 search results - page 11 / 21
» Genetic Algorithms and Explicit Search Statistics
Sort
View
COLT
1998
Springer
13 years 12 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund
SOCO
2010
Springer
13 years 6 months ago
Evolving the memory of a criminal's face: methods to search a face space more effectively
Witnesses and victims of serious crime are often required to construct a facial composite, a visual likeness of a suspect’s face. The traditional method is for them to select in...
Charlie D. Frowd, Vicki Bruce, Melanie Pitchford, ...
DCC
1998
IEEE
13 years 12 months ago
A Locally Optimal Design Algorithm for Block-Based Multi-Hypothesis Motion-Compensated Prediction
Multi-hypothesis motion-compensated prediction extends traditional motion-compensated prediction used in video coding schemes. Known algorithms for block-based multi-hypothesis mo...
Markus Flierl, Thomas Wiegand, Bernd Girod
ECTEL
2007
Springer
14 years 1 months ago
Relevance Ranking Metrics for Learning Objects
— The main objetive of this paper is to improve the current status of learning object search. First, the current situation is analyzed and a theretical solution, based on relevan...
Xavier Ochoa, Erik Duval
BMCBI
2007
166views more  BMCBI 2007»
13 years 7 months ago
Optimization of filtering criterion for SEQUEST database searching to improve proteome coverage in shotgun proteomics
Background: In proteomic analysis, MS/MS spectra acquired by mass spectrometer are assigned to peptides by database searching algorithms such as SEQUEST. The assignations of pepti...
Xinning Jiang, Xiaogang Jiang, Guanghui Han, Mingl...