Sciweavers

356 search results - page 33 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
ANOR
2004
122views more  ANOR 2004»
13 years 7 months ago
Call Center Staffing with Simulation and Cutting Plane Methods
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...
Júlíus Atlason, Marina A. Epelman, S...
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
13 years 9 months ago
Clustering for metric and non-metric distance measures
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...
Marcel R. Ackermann, Johannes Blömer, Christi...
RSA
2010
98views more  RSA 2010»
13 years 6 months ago
Network delay inference from additive metrics
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...
Shankar Bhamidi, Ram Rajagopal, Sébastien R...
CRYPTO
2006
Springer
104views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Random Selection with an Adversarial Majority
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...
Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
MLDM
2007
Springer
14 years 1 months ago
PE-PUC: A Graph Based PU-Learning Approach for Text Classification
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...
Shuang Yu, Chunping Li