Sciweavers

Share
JAIR
2011
88views more  JAIR 2011»
8 years 2 months ago
From "Identical" to "Similar": Fusing Retrieved Lists Based on Inter-Document Similarities
We present a novel approach to fusing document lists that are retrieved in response to a query. Our approach is based on utilizing information induced from inter-document similarit...
Anna Khudyak Kozorovitzky, Oren Kurland
JAIR
2011
214views more  JAIR 2011»
8 years 2 months ago
Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...
Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintve...
JAIR
2011
117views more  JAIR 2011»
8 years 2 months ago
Sequential Diagnosis by Abstraction
Sajjad Ahmed Siddiqi, Jinbo Huang
JAIR
2011
173views more  JAIR 2011»
8 years 2 months ago
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
J. Hoffmann
JAIR
2011
114views more  JAIR 2011»
8 years 2 months ago
Properties of Bethe Free Energies and Message Passing in Gaussian Models
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
Botond Cseke, Tom Heskes
JAIR
2011
123views more  JAIR 2011»
8 years 7 months ago
Regression Conformal Prediction with Nearest Neighbours
In this paper we apply Conformal Prediction (CP) to the k-Nearest Neighbours Regression (k-NNR) algorithm and propose ways of extending the typical nonconformity measure used for ...
Harris Papadopoulos, Vladimir Vovk, Alexander Gamm...
JAIR
2011
129views more  JAIR 2011»
8 years 7 months ago
Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
Previous studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an ...
Wei Li 0002, Pascal Poupart, Peter van Beek
JAIR
2011
134views more  JAIR 2011»
8 years 7 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
JAIR
2011
110views more  JAIR 2011»
8 years 7 months ago
Narrowing the Modeling Gap: A Cluster-Ranking Approach to Coreference Resolution
Traditional learning-based coreference resolvers operate by training the mention-pair model for determining whether two mentions are coreferent or not. Though conceptually simple ...
Altaf Rahman, Vincent Ng
JAIR
2011
138views more  JAIR 2011»
8 years 7 months ago
Identifying Aspects for Web-Search Queries
Many web-search queries serve as the beginning of an exploration of an unknown space of information, rather than looking for a specific web page. To answer such queries effectiv...
Fei Wu, Jayant Madhavan, Alon Y. Halevy
books