Sciweavers

18451 search results - page 3568 / 3691
» Selecting a Selection Procedure
Sort
View
ISI
2006
Springer
15 years 6 months ago
Entity Workspace: An Evidence File That Aids Memory, Inference, and Reading
An intelligence analyst often needs to keep track of more facts than can be held in human memory. As a result, analysts use a notebook or evidence file to record facts learned so f...
Eric A. Bier, Edward W. Ishak, Ed Chi
JMLR
2008
116views more  JMLR 2008»
15 years 6 months ago
Support Vector Machinery for Infinite Ensemble Learning
Ensemble learning algorithms such as boosting can achieve better performance by averaging over the predictions of some base hypotheses. Nevertheless, most existing algorithms are ...
Hsuan-Tien Lin, Ling Li
JMLR
2008
169views more  JMLR 2008»
15 years 6 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
JMLR
2008
73views more  JMLR 2008»
15 years 6 months ago
On the Suitable Domain for SVM Training in Image Coding
Conventional SVM-based image coding methods are founded on independently restricting the distortion in every image coefficient at some particular image representation. Geometrical...
Gustavo Camps-Valls, Juan Gutierrez, Gabriel G&oac...
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
« Prev « First page 3568 / 3691 Last » Next »