Sciweavers

189 search results - page 1 / 38
» Polynomial-time Computation via Local Inference Relations
Sort
View
JMLR
2010
115views more  JMLR 2010»
12 years 11 months ago
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact ...
Nic Schraudolph
CORR
2000
Springer
73views Education» more  CORR 2000»
13 years 4 months ago
Polynomial-time Computation via Local Inference Relations
Robert Givan, David A. McAllester
ALT
2004
Springer
14 years 1 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
ACL
1990
13 years 6 months ago
The Computational Complexity of Avoiding Conversational Implicatures
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
Ehud Reiter
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
13 years 4 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow