9886 search results - page 1286 / 1978 » Learning Compressible Models |
192
click to vote
SEMWEB
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. While the number and size of Semantic Web knowledge bases increases, their maintenance and quality assurance are still difficult. In this article, we present ORE, a tool ...
220
click to vote
COLING
2010
15 years 2 months ago
2010
We explore the near-synonym lexical choice problem using a novel representation of near-synonyms and their contexts in the latent semantic space. In contrast to traditional latent...
264
Voted
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
We propose a novel nonlinear, probabilistic and variational method for adding shape information to level setbased segmentation and tracking. Unlike previous work, we represent sha...
212
Voted
CORR
2012
Springer
14 years 3 months ago
2012
Springer
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
236
Voted
JMLR
2012
13 years 9 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...