Sciweavers

1651 search results - page 103 / 331
» Measuring the Complexity of Classification Problems
Sort
View
CGI
2004
IEEE
13 years 11 months ago
Fast Environmental Lighting for Local-PCA Encoded BTFs
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
Gero Müller, Jan Meseth, Reinhard Klein
MICCAI
2009
Springer
14 years 5 months ago
ECOC Random Fields for Lumen Segmentation in Radial Artery IVUS Sequences
The measure of lumen volume on radial arteries can be used to evaluate the vessel response to different vasodilators. In this paper, we present a framework for automatic lumen segm...
Francesco Ciompi, Oriol Pujol, Eduard Ferná...
ICMLA
2009
13 years 5 months ago
Mahalanobis Distance Based Non-negative Sparse Representation for Face Recognition
Sparse representation for machine learning has been exploited in past years. Several sparse representation based classification algorithms have been developed for some application...
Yangfeng Ji, Tong Lin, Hongbin Zha
NIPS
2001
13 years 9 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
ICTAI
1992
IEEE
13 years 12 months ago
Genetic Algorithms as a Tool for Feature Selection in Machine Learning
This paper describes an approach being explored to improve the usefulness of machine learning techniques for generating classification rules for complex, real world data. The appr...
Haleh Vafaie, Kenneth A. De Jong