Sciweavers

6274 search results - page 39 / 1255
» From query complexity to computational complexity
Sort
View
109
Voted
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
16 years 8 hour ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
128
Voted
COMAD
2008
15 years 4 months ago
Querying for Information Integration: How to go from an Imprecise Intent to a Precise Query?
In this paper, we address the problem of query formulation in the context of multi-domain integration of heterogeneous data on the Web. We argue that effectively tackling this pro...
Aditya Telang, Sharma Chakravarthy, Chengkai Li
166
Voted
DEXAW
2006
IEEE
139views Database» more  DEXAW 2006»
15 years 4 months ago
Consistent Query Answering By Minimal-Size Repairs
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...
Andrei Lopatenko, Leopoldo E. Bertossi
WOLLIC
2009
Springer
15 years 9 months ago
Query Answering in Description Logics: The Knots Approach
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Manta...
166
Voted
AMSTERDAM
2009
15 years 13 days ago
The Data Complexity of the Syllogistic Fragments of English
Abstract. Pratt and Third's syllogistic fragments of English can be used to capture, in addition to syllogistic reasoning, many other kinds of common sense reasoning, and, in ...
Camilo Thorne, Diego Calvanese