Sciweavers

5699 search results - page 743 / 1140
» Alternating model trees
Sort
View
JMLR
2010
141views more  JMLR 2010»
15 years 1 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...
184
Voted
JMLR
2010
104views more  JMLR 2010»
15 years 1 months ago
How to Explain Individual Classification Decisions
After building a classifier with modern tools of machine learning we typically have a black box at hand that is able to predict well for unseen data. Thus, we get an answer to the...
David Baehrens, Timon Schroeter, Stefan Harmeling,...
207
Voted
AAAI
2011
14 years 6 months ago
Dual Decomposition for Marginal Inference
We present a dual decomposition approach to the treereweighted belief propagation objective. Each tree in the tree-reweighted bound yields one subproblem, which can be solved with...
Justin Domke
EMNLP
2011
14 years 6 months ago
Quasi-Synchronous Phrase Dependency Grammars for Machine Translation
We present a quasi-synchronous dependency grammar (Smith and Eisner, 2006) for machine translation in which the leaves of the tree are phrases rather than words as in previous wor...
Kevin Gimpel, Noah A. Smith
181
Voted
CVPR
2009
IEEE
17 years 2 months ago
Angular Embedding: from Jarring Intensity Differences to Perceived Luminance
Our goal is to turn an intensity image into its perceived luminance without parsing it into depths, surfaces, or scene illuminations. We start with jarring intensity differences at...
Stella X. Yu