6274 search results - page 244 / 1255 » From query complexity to computational complexity |
165
Voted
CONIELECOMP
2004
IEEE
15 years 8 months ago
2004
IEEE
In this paper we present a set of formulations that describe some properties of the configurations that can represent the n-Dimensional Orthogonal PseudoPolytopes. Moreover, we de...
226
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
We propose an extension to current view-based mediator systems called model-based mediation, in which views are defined and executed at the level of conceptual models (CMs) rather...
125
click to vote
PODS
2005
ACM
16 years 5 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
160
click to vote
JAIR
2002
15 years 4 months ago
2002
We propose a structured approach to the problem of retrieval of images by content and present a description logic that has been devised for the semantic indexing and retrieval of ...
244
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...