Sciweavers

114 search results - page 15 / 23
» jair 2006
Sort
View
JAIR
2006
143views more  JAIR 2006»
13 years 9 months ago
Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
Tom Heskes
JAIR
2006
87views more  JAIR 2006»
13 years 9 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
JAIR
2006
110views more  JAIR 2006»
13 years 9 months ago
Domain Adaptation for Statistical Classifiers
The most basic assumption used in statistical learning theory is that training data and test data are drawn from the same underlying distribution. Unfortunately, in many applicati...
Hal Daumé III, Daniel Marcu
JAIR
2006
121views more  JAIR 2006»
13 years 9 months ago
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
Matthew J. Streeter, Stephen F. Smith
JAIR
2006
137views more  JAIR 2006»
13 years 9 months ago
Learning Sentence-internal Temporal Relations
In this paper we propose a data intensive approach for inferring sentence-internal temporal relations. Temporal inference is relevant for practical NLP applications which either e...
Maria Lapata, Alex Lascarides