Sciweavers

530 search results - page 57 / 106
» An Algorithm for Approximating the Satisfiability Problem of...
Sort
View
ICTIR
2009
Springer
14 years 2 months ago
Score Distributions in Information Retrieval
We review the history of modeling score distributions, focusing on the mixture of normal-exponential by investigating the theoretical as well as the empirical evidence supporting i...
Avi T. Arampatzis, Stephen Robertson, Jaap Kamps
IR
2011
12 years 11 months ago
Modeling score distributions in information retrieval
We review the history of modeling score distributions, focusing on the mixture of normal-exponential by investigating the theoretical as well as the empirical evidence supporting i...
Avi Arampatzis, Stephen Robertson
IANDC
2008
122views more  IANDC 2008»
13 years 8 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
ACM
1995
13 years 11 months ago
Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
Zdzislaw Pawlak
ICDT
2010
ACM
125views Database» more  ICDT 2010»
14 years 2 min ago
Synthesizing View Definitions from Data
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
Anish Das Sarma, Aditya Parameswaran, Hector Garci...