Sciweavers

1039 search results - page 158 / 208
» Query reformulation with constraints
Sort
View
PODS
2012
ACM
253views Database» more  PODS 2012»
13 years 6 days ago
Local transformations and conjunctive-query equivalence
Over the past several decades, the study of conjunctive queries has occupied a central place in the theory and practice of database systems. In recent years, conjunctive queries h...
Ronald Fagin, Phokion G. Kolaitis
CIKM
2009
Springer
15 years 4 months ago
Enabling multi-level relevance feedback on pubmed by integrating rank learning into DBMS
Background: Finding relevant articles from PubMed is challenging because it is hard to express the user’s specific intention in the given query interface, and a keyword query ty...
Hwanjo Yu, Taehoon Kim, Jinoh Oh, Ilhwan Ko, Sungc...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 10 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
CSL
2009
Springer
15 years 1 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
CSFW
2004
IEEE
15 years 1 months ago
Cassandra: Flexible Trust Management, Applied to Electronic Health Records
We study the specification of access control policy in large-scale distributed systems. We present Cassandra, a language and system for expressing policy, and the results of a sub...
Moritz Y. Becker, Peter Sewell