377 search results - page 53 / 76 » Distributionally Robust Optimization and Its Tractable Appro... |
113
click to vote
WEBI
2007
Springer
15 years 6 months ago
2007
Springer
The volume of spam e-mails has grown rapidly in the last two years resulting in increasing costs to users, network operators, and e-mail service providers (ESPs). E-mail users dem...
NIPS
2007
15 years 1 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
106
click to vote
PLDI
2010
ACM
15 years 4 months ago
2010
ACM
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
131
click to vote
TKDE
2012
13 years 2 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
107
click to vote
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...