356 search results - page 33 / 72 » Solving the Small Sample Size Problem of LDA |
124
click to vote
ANOR
2004
15 years 3 months ago
2004
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
142
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
113
click to vote
RSA
2010
15 years 1 months ago
2010
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
136
click to vote
CRYPTO
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
106
click to vote
MLDM
2007
Springer
15 years 9 months ago
2007
Springer
This paper presents a novel solution for the problem of building text classifier using positive documents (P) and unlabeled documents (U). Here, the unlabeled documents are mixed w...