—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams
As multi-core processors with tens or hundreds of cores begin to proliferate, system optimization issues once faced only by the high-performance computing (HPC) community will bec...
Mohan Rajagopalan, Brian T. Lewis, Todd A. Anderso...
Treebank parsing can be seen as the search for an optimally refined grammar consistent with a coarse training treebank. We describe a method in which a minimal grammar is hierarc...
Variational methods for approximate inference in machine learning often adapt a parametric probability distribution to optimize a given objective function. This view is especially ...
Antti Honkela, Matti Tornio, Tapani Raiko, Juha Ka...
Modern classification applications necessitate supplementing the few available labeled examples with unlabeled examples to improve classification performance. We present a new tra...