Sciweavers

SIGIR
2010
ACM
13 years 2 months ago
DivQ: diversification for keyword search over structured databases
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
Elena Demidova, Peter Fankhauser, Xuan Zhou, Wolfg...
AND
2010
13 years 2 months ago
A platform for storing, visualizing, and interpreting collections of noisy documents
The goal of document image analysis is to produce interpretations that match those of a uent and knowledgeable human when viewing the same input. Because computer vision technique...
Bart Lamiroy, Daniel P. Lopresti
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 4 months ago
Transforming structures by set interpretations
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas w...
Thomas Colcombet, Christof Löding
EUSFLAT
2007
108views Fuzzy Logic» more  EUSFLAT 2007»
13 years 5 months ago
Homomorphisms of Fuzzy Logic Models Based on Sets With Similarities
We investigate interpretations ψ D of formulas ψ in a first order fuzzy logic in models D which are based on Ω-sets, i.e. sets with similarity relations with values in a comp...
Jiri Mockor
ESWS
2008
Springer
13 years 6 months ago
Assisting Pictogram Selection with Semantic Interpretation
Participants at both end of the communication channel must share common pictogram interpretation to communicate. However, because pictogram interpretation can be ambiguous, pictogr...
Heeryon Cho, Toru Ishida, Toshiyuki Takasaki, Sato...
SIGSOFT
1993
ACM
13 years 8 months ago
Using Style to Understand Descriptions of Software Architecture
The software architecture of most systems is described informally and diagrammatically. In order for these descriptions to be meaningful at all, gures are understood by interpreti...
Gregory D. Abowd, Robert Allen, David Garlan
EUROCOLT
1999
Springer
13 years 8 months ago
Learning Range Restricted Horn Expressions
We study the learnability of first order Horn expressions from equivalence and membership queries. We show that the class of expressions where every term in the consequent of a c...
Roni Khardon
ECSQARU
2001
Springer
13 years 9 months ago
General Preferential Entailments as Circumscriptions
Abstract A (general) preferential entailment is defined by a “preference relation” among “states”. States can be either interpretations or sets of interpretations, or “c...
Yves Moinard
PRICAI
2004
Springer
13 years 9 months ago
An Anytime Algorithm for Interpreting Arguments
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
Sarah George, Ingrid Zukerman, Michael Niemann
WOLLIC
2007
Springer
13 years 10 months ago
Computational Interpretations of Classical Linear Logic
We survey several computational interpretations of classical linear logic based on two-player one-move games. The moves of the games are higherorder functionals in the language of ...
Paulo Oliva