356 search results - page 48 / 72 » Solving the Small Sample Size Problem of LDA |
COMPSAC
2006
IEEE
14 years 1 months ago
2006
IEEE
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
ICCV
2009
IEEE
15 years 16 days ago
2009
IEEE
In this paper we propose an algorithm to estimate missing
values in tensors of visual data. The values can be missing
due to problems in the acquisition process, or because
the ...
IVC
2007
13 years 7 months ago
2007
We consider the problem of image classification when more than one visual feature is available. In such cases, Bayes fusion offers an attractive solution by combining the result...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Much work on skewed, stochastic, high dimensional, and biased datasets usually implicitly solve each problem separately. Recently however, we have been approached by Texas Commiss...