654 search results - page 116 / 131 » Complexity of Answering Queries Using Materialized Views |
140
Voted
LPAR
2004
Springer
15 years 8 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
144
Voted
SODA
1990
ACM
15 years 3 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
145
Voted
JUCS
2008
15 years 2 months ago
2008
Abstract: Information integration applications combine data from heterogeneous sources to assist the user in solving repetitive data-intensive tasks. Currently, such applications r...
158
Voted
IS
2011
14 years 9 months ago
2011
—It is common for large and complex organizations to maintain repositories of business process models in order to document and to continuously improve their operations. Given suc...
126
Voted
AAAI
2011
14 years 2 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...