148 search results - page 19 / 30 » Query Evaluation via Tree-Decompositions |
AAAI
2011
12 years 7 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
WINE
2007
Springer
14 years 1 months ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
ICMI
2005
Springer
14 years 27 days ago
2005
Springer
This paper presents Latent Semantic Googling, a variant of Landauer’s Latent Semantic Indexing that uses the Google search engine to judge the semantic closeness of sets of word...
LICS
2000
IEEE
13 years 11 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
TLSDKCS
2010
13 years 2 months ago
2010
Abstract. With increasing volumes of data, much effort has been devoted to finding the most suitable answer to an information need. However, in many domains, the question whether a...