Sciweavers

857 search results - page 63 / 172
» Maximum Entropy Utility
Sort
View
ICML
2003
IEEE
14 years 9 months ago
Hidden Markov Support Vector Machines
This paper presents a novel discriminative learning technique for label sequences based on a combination of the two most successful learning algorithms, Support Vector Machines an...
Yasemin Altun, Ioannis Tsochantaridis, Thomas Hofm...
ICASSP
2008
IEEE
14 years 3 months ago
A GIS-like training algorithm for log-linear models with hidden variables
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
Georg Heigold, Thomas Deselaers, Ralf Schlüte...
NIPS
2007
13 years 10 months ago
Boosting Algorithms for Maximizing the Soft Margin
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....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
ICASSP
2010
IEEE
13 years 9 months ago
Language recognition using deep-structured conditional random fields
We present a novel language identification technique using our recently developed deep-structured conditional random fields (CRFs). The deep-structured CRF is a multi-layer CRF mo...
Dong Yu, Shizhen Wang, Zahi Karam, Li Deng
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 9 months ago
Capacity Regions and Bounds for a Class of Z-interference Channels
We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A ...
Nan Liu, Andrea J. Goldsmith