Sciweavers

356 search results - page 16 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Custom color enhancements by statistical learning
We consider the problem of automatically learning color enhancements from a small set of sample color pairs, and describing the enhancement by a three-dimensional look-uptable tha...
Maya R. Gupta
JMLR
2008
104views more  JMLR 2008»
13 years 7 months ago
Learning Reliable Classifiers From Small or Incomplete Data Sets: The Naive Credal Classifier 2
In this paper, the naive credal classifier, which is a set-valued counterpart of naive Bayes, is extended to a general and flexible treatment of incomplete data, yielding a new cl...
Giorgio Corani, Marco Zaffalon
QSIC
2003
IEEE
14 years 23 days ago
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
Christine Cheng, Adrian Dumitrescu, Patrick J. Sch...
ECCC
2010
89views more  ECCC 2010»
13 years 7 months ago
Estimating the unseen: A sublinear-sample canonical estimator of distributions
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...
Gregory Valiant, Paul Valiant
ISCA
1993
IEEE
112views Hardware» more  ISCA 1993»
13 years 11 months ago
Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors
The distribution of resources among processors, memory and caches is a crucial question faced by designers of large-scale parallel machines. If a machine is to solve problems with...
Edward Rothberg, Jaswinder Pal Singh, Anoop Gupta