Sciweavers

588 search results - page 21 / 118
» Positive higher-order queries
Sort
View
ALT
2003
Springer
15 years 10 months ago
On the Learnability of Erasing Pattern Languages in the Query Model
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
Steffen Lange, Sandra Zilles
ICDT
2010
ACM
194views Database» more  ICDT 2010»
15 years 3 months ago
Bag Equivalence of XPath Queries
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...
Sara Cohen, Yaacov Y. Weiss
SIGIR
2002
ACM
15 years 1 months ago
Predicting query performance
We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model. The resultin...
Stephen Cronen-Townsend, Yun Zhou, W. Bruce Croft
TAMC
2007
Springer
15 years 8 months ago
A Characterization of the Language Classes Learnable with Correction Queries
Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
Cristina Tîrnauca, Satoshi Kobayashi
SIGIR
2008
ACM
15 years 1 months ago
Exploiting sequential dependencies for expert finding
We propose an expert finding method based on assumption of sequential dependence between a candidate expert and the query terms in the scope of a document. We assume that the stre...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra